8294 search results - page 1172 / 1659 » Presenting Data from Experiments in Algorithmics |
170
click to vote
KDD
2004
ACM
16 years 6 months ago
2004
ACM
Past empirical work has shown that learning multiple related tasks from data simultaneously can be advantageous in terms of predictive performance relative to learning these tasks...
312
Voted
VLDB
2002
ACM
16 years 6 months ago
2002
ACM
Our aim is to develop new database technologies for the approximate matching of unstructured string data using indexes. We explore the potential of the suffix tree data structure i...
166
Voted
PODS
2006
ACM
16 years 6 months ago
2006
ACM
B-trees are the data structure of choice for maintaining searchable data on disk. However, B-trees perform suboptimally ? when keys are long or of variable length, ? when keys are...
171
click to vote
CIKM
2009
Springer
16 years 1 months ago
2009
Springer
We propose a partitioning scheme for similarity search indexes that is called Maximal Metric Margin Partitioning (MMMP). MMMP divides the data on the basis of its distribution pat...
185
click to vote
ICDCSW
2005
IEEE
16 years 2 days ago
2005
IEEE
Today’s multimedia environments are characterized by different stationary and a growing number of mobile devices, like PDAs or even mobile phones. To meet their requirements reg...