6615 search results - page 367 / 1323 » Indexing Multiple Sets |
209
click to vote
TREC
2007
15 years 8 months ago
2007
: The aims of this paper are twofold. Our first aim is to compare results of the earlier Terabyte tracks to the Million Query track. We submitted a number of runs using different ...
141
click to vote
DAM
2010
15 years 6 months ago
2010
Let G be a multigraph. We say that G is 1-extendable if every edge of G is contained in a 1-factor. Suppose G is 1-extendable. An excessive factorization of G is a set F = {F1, F2...
194
click to vote
IAJIT
2008
15 years 6 months ago
2008
: The fuzzy c-means clustering algorithm has been widely used to obtain the fuzzy k-partitions. This algorithm requires that the user gives the number of clusters k. To find automa...
161
click to vote
CHI
2002
ACM
16 years 7 months ago
2002
ACM
Title of Dissertation: INTERACTIVE GRAPHICAL QUERYING OF TIME SERIES AND LINEAR SEQUENCE DATA SETS Harry Hochheiser, Doctor of Philosophy, 2003 Dissertation directed by: Professor...
298
click to vote
SIGMOD
2008
ACM
16 years 7 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...