Sciweavers

3510 search results - page 94 / 702
» Searching with numbers
Sort
View
SWAT
1992
Springer
147views Algorithms» more  SWAT 1992»
15 years 10 months ago
Efficient Rebalancing of Chromatic Search Trees
In PODS'91, Nurmi and Soisalon-Soininen presented a new type of binary search tree for databases, which they call a chromatic tree. The aim is to improve runtime performance ...
Joan Boyar, Kim S. Larsen
ICDE
2012
IEEE
227views Database» more  ICDE 2012»
13 years 8 months ago
Horizontal Reduction: Instance-Level Dimensionality Reduction for Similarity Search in Large Document Databases
—Dimensionality reduction is essential in text mining since the dimensionality of text documents could easily reach several tens of thousands. Most recent efforts on dimensionali...
Min-Soo Kim 0001, Kyu-Young Whang, Yang-Sae Moon
WEBI
2009
Springer
16 years 1 months ago
In the Mood to Click? Towards Inferring Receptiveness to Search Advertising
Abstract—We present a method for modeling, and automatically inferring, the current interest of a user in search advertising. Our task is complementary to that of predicting ad r...
Qi Guo, Eugene Agichtein, Charles L. A. Clarke, Az...
CEC
2005
IEEE
15 years 8 months ago
Rank and proximity based crossover (RPC) to improve convergence in genetic search
A new crossover technique, we named Rank and Proximity Based Crossover (RPC), to improve the speed and quality of solutions in Genetic search, is proposed. In the proposed strategy...
Goutam Chakraborty, Basabi Chakraborty
JODL
2006
136views more  JODL 2006»
15 years 6 months ago
An experimental effectiveness comparison of methods for 3D similarity search
Methods for content-based similarity search are fundamental for managing large multimedia repositories, as they make it possible to conduct queries for similar content, and to orga...
Benjamin Bustos, Daniel A. Keim, Dietmar Saupe, To...