Sciweavers

3652 search results - page 560 / 731
» A study of query length
Sort
View
PLDI
2005
ACM
16 years 1 days ago
Jungloid mining: helping to navigate the API jungle
Reuse of existing code from class libraries and frameworks is often difficult because APIs are complex and the client code required to use the APIs can be hard to write. We obser...
David Mandelin, Lin Xu, Rastislav Bodík, Do...
CIKM
2005
Springer
16 years 21 hour ago
Towards estimating the number of distinct value combinations for a set of attributes
Accurately and efficiently estimating the number of distinct values for some attribute(s) or sets of attributes in a data set is of critical importance to many database operation...
Xiaohui Yu, Calisto Zuzarte, Kenneth C. Sevcik
ESWS
2005
Springer
16 years 14 hour ago
RELFIN - Topic Discovery for Ontology Enhancement and Annotation
While classic information retrieval methods return whole documents as a result of a query, many information demands would be better satisfied by fine-grain access inside the docu...
Markus Schaal, Roland M. Müller, Marko Brunze...
ICALP
2004
Springer
15 years 12 months ago
The Black-Box Complexity of Nearest Neighbor Search
We define a natural notion of efficiency for approximate nearest-neighbor (ANN) search in general n-point metric spaces, namely the existence of a randomized algorithm which answ...
Robert Krauthgamer, James R. Lee
PAM
2004
Springer
15 years 12 months ago
Measurements and Laboratory Simulations of the Upper DNS Hierarchy
Given that the global DNS system, especially at the higher root and top-levels, experiences significant query loads, we seek to answer the following questions: (1) How does the ch...
Duane Wessels, Marina Fomenkov, Nevil Brownlee, Ki...