Sciweavers

1921 search results - page 114 / 385
» Stereo Without Search
Sort
View
187
Voted
COMPGEOM
2010
ACM
15 years 8 months ago
A dynamic data structure for approximate range searching
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
David M. Mount, Eunhui Park
119
Voted
VLDB
1998
ACM
91views Database» more  VLDB 1998»
15 years 8 months ago
Determining Text Databases to Search in the Internet
Text data in the Internet can be partitioned into many databases naturally. Efficient retrieval of desired data can be achieved if we can accurately predict the usefulness of each...
Weiyi Meng, King-Lup Liu, Clement T. Yu, Xiaodong ...
ACMICEC
2007
ACM
220views ECommerce» more  ACMICEC 2007»
15 years 7 months ago
Asymptotically optimal repeated auctions for sponsored search
We investigate asymptotically optimal keyword auctions, that is, auctions which maximize revenue as the number of bidders grows. We do so under two alternative behavioral assumpti...
Nicolas S. Lambert, Yoav Shoham
124
Voted
TREC
2003
15 years 5 months ago
Searching for geneRIFs: Concept-Based Query Expansion and Bayes Classification
k gene annotations. Our indexing machinery produces per indexed MEDLINE abstract a list of concepts with an accompanying weight, termed a fingerprint. Searching is done by matching...
Rob Jelier, Martijn J. Schuemie, C. Christiaan van...
CEC
2010
IEEE
15 years 4 months ago
Learning-assisted evolutionary search for scalable function optimization: LEM(ID3)
Inspired originally by the Learnable Evolution Model(LEM) [5], we investigate LEM(ID3), a hybrid of evolutionary search with ID3 decision tree learning. LEM(ID3) involves interleav...
Guleng Sheri, David Corne