Sciweavers

985 search results - page 176 / 197
» Composite feature modeling and retrieval
Sort
View
SIGIR
2006
ACM
14 years 1 months ago
Type less, find more: fast autocompletion search with a succinct index
We consider the following full-text search autocompletion feature. Imagine a user of a search engine typing a query. Then with every letter being typed, we would like an instant d...
Holger Bast, Ingmar Weber
AIRWEB
2008
Springer
13 years 9 months ago
The anti-social tagger: detecting spam in social bookmarking systems
The annotation of web sites in social bookmarking systems has become a popular way to manage and find information on the web. The community structure of such systems attracts spam...
Beate Krause, Christoph Schmitz, Andreas Hotho, Ge...
SSDBM
2006
IEEE
122views Database» more  SSDBM 2006»
14 years 1 months ago
Probabilistic Ranking Queries on Gaussians
In many modern applications, there are no exact values available to describe the data objects. Instead, the feature values are considered to be uncertain. This uncertainty is mode...
Christian Böhm, Alexey Pryakhin, Matthias Sch...
AEI
2004
87views more  AEI 2004»
13 years 7 months ago
Estimating the productivity of cyclic construction operations using case-based reasoning
The estimation of productivity rates in cyclic construction processes is a difficult, but essential task in the planning of construction projects. The conventional method--a calcu...
Darren Graham, Simon D. Smith
POPL
2011
ACM
12 years 10 months ago
Safe nondeterminism in a deterministic-by-default parallel language
A number of deterministic parallel programming models with strong safety guarantees are emerging, but similar support for nondeterministic algorithms, such as branch and bound sea...
Robert L. Bocchino Jr., Stephen Heumann, Nima Hona...