Sciweavers

2089 search results - page 182 / 418
» A New Problem in String Searching
Sort
View
CIKM
2009
Springer
15 years 2 months ago
Low-cost management of inverted files for online full-text search
In dynamic environments with frequent content updates, we require online full-text search that scales to large data collections and achieves low search latency. Several recent met...
Giorgos Margaritis, Stergios V. Anastasiadis
80
Voted
JAIR
2000
123views more  JAIR 2000»
14 years 10 months ago
Backbone Fragility and the Local Search Cost Peak
The local search algorithm WSat is one of the most successful algorithms for solving the satisfiability (SAT) problem. It is notably effective at solving hard Random 3-SAT instanc...
Josh Singer, Ian P. Gent, Alan Smaill
85
Voted
DSN
2009
IEEE
15 years 5 months ago
Fitness-guided path exploration in dynamic symbolic execution
Dynamic symbolic execution is a structural testing technique that systematically explores feasible paths of the program under test by running the program with different test input...
Tao Xie, Nikolai Tillmann, Jonathan de Halleux, Wo...
SIGMOD
1997
ACM
127views Database» more  SIGMOD 1997»
15 years 2 months ago
Fast Parallel Similarity Search in Multimedia Databases
Most similarity search techniques map the data objects into some high-dimensional feature space. The similarity search then corresponds to a nearest-neighbor search in the feature...
Stefan Berchtold, Christian Böhm, Bernhard Br...
WWW
2011
ACM
14 years 5 months ago
Characterizing search intent diversity into click models
Modeling a user’s click-through behavior in click logs is a challenging task due to the well-known position bias problem. Recent advances in click models have adopted the examin...
Botao Hu, Yuchen Zhang, Weizhu Chen, Gang Wang, Qi...