2635 search results - page 348 / 527 » Algorithms for the Database Layout Problem |
191
click to vote
DM
2006
15 years 6 months ago
2006
A computer package is being developed at Bayreuth for the generation and investigation of discrete structures. The package is a C and C++ class library of powerful algorithms endow...
279
click to vote
SIGMOD
2008
ACM
16 years 6 months ago
2008
ACM
Approximate queries on a collection of strings are important in many applications such as record linkage, spell checking, and Web search, where inconsistencies and errors exist in...
167
click to vote
SIGMOD
2010
ACM
15 years 11 months ago
2010
ACM
Maximal clique enumeration (MCE) is a fundamental problem in graph theory and has important applications in many areas such as social network analysis and bioinformatics. The prob...
218
click to vote
MM
2009
ACM
15 years 11 months ago
2009
ACM
Content Based Image Retrieval (CBIR) has become one of the most active research areas in computer science. Relevance feedback is often used in CBIR systems to bridge the semantic ...
247
click to vote
VLDB
1999
ACM
1999
ACM
Optimal Grid-Clustering: Towards Breaking the Curse of Dimensionality in High-Dimensional Clustering
15 years 10 months ago
Many applications require the clustering of large amounts of high-dimensional data. Most clustering algorithms, however, do not work e ectively and e ciently in highdimensional sp...