bookmarks (hide)131
- Here you have a DBSCAN code implemented in C++, boost and stl
- OnlyWire syndicates your content and articles to the web's top social networking sites with a single button click. The OnlyWire Bookmark & Share button gives your website and blog visitors the ability to post your content to all of their social networking sites.
- A variety way of countings bits fast.
- If you install macports you can install gcc select, and then choose your gcc version. /opt/local/bin/port install gcc_select To see your versions use port select --list gcc To select a version use sudo port select --set gcc gcc40
- This is a "tree of all knowledge" category, a top-level place to start when browsing Wikipedia categories for articles. This is the top level in terms of encyclopedia article function and content. It is intended to contain all and only the few most fundamental ontological categories which can reasonably be expected to contain every possible Wikipedia article under their category trees. These categories are: physical entities; biological entities; social entities; and intellectual entities. An alternative root category, based on a somewhat more detailed initial classification, is Category:Main topic classifications.
- This is a list of Wikipedia's major topic classifications. These are used throughout Wikipedia to organize the presentation of links to articles on its various reference systems, including Wikipedia's lists, portals, and categories.
- Comparison of naive bayes classifiers, support vector machines and modular multilayer perceptron neural networks.
- A list of cluster papers. Includes some links to source code.
- The Community Z Tools (CZT) project is building a set of tools for editing, typechecking and animating formal specifications written in the Z specification language, with some support for Z extensions such as Object-Z, Circus, and TCOZ. These tools are all built using the CZT Java framework for Z tools.
- information on comparing floats
- If two numbers b and c have the property that their difference b-c is integrally divisible by a number m (i.e., (b-c)/m is an integer), then b and c are said to be "congruent modulo m."
- Consensus clustering has emerged as an important elaboration of the classical clustering problem. Consensus clustering, also called aggregation of clustering (or partitions), refers to the situation in which a number of different (input) clusterings have been obtained for a particular dataset and it is desired to find a single (consensus) clustering which is a better fit in some sense than the existing clusterings. Consensus clustering is thus the problem of reconciling clustering information about the same data set coming from different sources or from different runs of the same algorithm. When cast as an optimization problem, consensus clustering is known as median partition, and has been shown to be NP-complete.
- Information on convex hull algorithms, including algorithms for high dimensional spaces.
- This series of three talks will give a nontechnical, high level overview of geometric complexity theory (GCT), which is an approach to the P vs. NP problem via algebraic geometry, representation theory, and the theory of a new class of quantum groups, called nonstandard quantum groups, that arise in this approach.
- Excellence of any sort--excellent dancing, excellent quarterbacking, excellent woodworking--has no waste. You fix wordy writing by doing the same job using fewer words.
- Delta Debugging automates the scientific method of debugging. The Delta Debugging algorithm isolates failure causes automatically - by systematically narrowing down failure-inducing circumstances until a minimal set remains.
- Elefant (Efficient Learning, Large-scale Inference, and Optimisation Toolkit) is an open source library for machine learning licensed under the Mozilla Public License (MPL). We develop an open source machine learning toolkit which provides
- Commonly used commands from the vim text editor.
- fastutil extends the Java™ Collections Framework by providing type-specific maps, sets, lists and queues with a small memory footprint and fast access and insertion; it also includes a fast I/O API for binary and text files. It is free software distributed under the GNU Lesser General Public License.
- flexbackup is for you if you have a single or small number of machines, amanda is "too much", and tarring things up by hand isn't nearly enough...
- The FOSS in Research and Student Innovation Miniconf brings together researchers and students with an active interest in Free and Open Source Software with the broader Linux.conf.au community to highlight exciting work taking place within the often esoteric world of academia and educational institutions. The Miniconf is part of Linux.conf.au 2011, being held at the QUT Gardens Point Campus in Brisbane, Queensland in January. Topics are split into two streams: FOSS in Research, which invites presentations on research relating to Free and Open Source Software; and Student Innovation, which explores new and exciting work in the FOSS world conducted by students. Presentations may be proposed in a 25-minute talk format (20 minutes talk + 5 minutes discussion).
- Using GCC ASM syntax for SIMD instructions.
- This website provides tutorials and sample course content so CS students and educators can learn more about current computing technologies and paradigms. In particular, this content is Creative Commons licensed which makes it easy for CS educators to use in their own classes. The Courses section contains tutorials, lecture slides, and problem sets for a variety of topic areas: AJAX Programming Algorithms Distributed Systems Web Security Languages In the Tools 101 section, you will find a set of introductions to some common tools used in Computer Science such as version control systems and databases. The CS Curriculum Search will help you find teaching materials that have been published to the web by faculty from CS departments around the world. You can refine your search to display just lectures, assignments or reference materials for a set of courses.
- In mathematical logic, Gödel's incompleteness theorems, proved by Kurt Gödel in 1931, are two theorems stating inherent limitations of all but the most trivial formal systems for arithmetic of mathematical interest. The theorems are of considerable importance to the philosophy of mathematics. They are widely regarded as showing that Hilbert's program to find a complete and consistent set of axioms for all of mathematics is impossible, thus giving a negative answer to Hilbert's second problem.
publications
(hide)135
This list of posts may not be accurate to recent changes. If you want accurate posts, but with limited sorting follow this link.
- (2000)
- (2006)
- LECTURE NOTES IN COMPUTER SCIENCE, (2007)
- KDD '05: Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining, page 685--690. New York, NY, USA, ACM, (2005)
- Information systems, 5 (3): 189--195 (1980)
- ICML2010, (2010)
- HP Labs Technical Reports, (2007)
- (2008)
- Grouping Multidimensional Data, (2006)
- SIGKDD Explor. Newsl., 5 (1): 49--58 (2003)
- Proceedings of the 2010 ACM Symposium on Applied Computing, page 1708--1712. New York, NY, USA, ACM, (2010)
- SIGIR Forum, (June 2009)
- CIKM '02: Proceedings of the eleventh international conference on Information and knowledge management, page 600--607. New York, NY, USA, ACM, (2002)
- Program: Electronic Library and Information Systems, 40 (3): 211--218 (2006)
- Random Structures & Algorithms, 22 (1): 60--65 (2002)
- IEEE Transactions on Knowledge and Data Engineering, 19 (8): 1026-1041 (2007)
- (1996)
- STOC '02: Proceedings of the thiry-fourth annual ACM symposium on Theory of computing, page 250--257. New York, NY, USA, ACM, (2002)
- SODA '09: Proceedings of the Nineteenth Annual ACM -SIAM Symposium on Discrete Algorithms, page 1068--1077. Philadelphia, PA, USA, Society for Industrial and Applied Mathematics, (2009)
- (2006)
