Sciweavers

3341 search results - page 365 / 669
» Managing a Large
Sort
View
SIGIR
2010
ACM
15 years 10 months ago
Reusable test collections through experimental design
Portable, reusable test collections are a vital part of research and development in information retrieval. Reusability is difficult to assess, however. The standard approach— si...
Ben Carterette, Evangelos Kanoulas, Virgiliu Pavlu...
CIKM
2006
Springer
15 years 10 months ago
Re-ranking search results using query logs
This work addresses two common problems in search, frequently occurring with underspecified user queries: the top-ranked results for such queries may not contain documents relevan...
Ziming Zhuang, Silviu Cucerzan
VLDB
1997
ACM
170views Database» more  VLDB 1997»
15 years 10 months ago
M-tree: An Efficient Access Method for Similarity Search in Metric Spaces
A new access method, called M-tree, is proposed to organize and search large data sets from a generic "metric space", i.e. where object proximity is only defined by a di...
Paolo Ciaccia, Marco Patella, Pavel Zezula
ATAL
2008
Springer
15 years 8 months ago
Replacing the stop sign: unmanaged intersection control for autonomous vehicles
As computers inevitably begin to replace humans as the drivers of automobiles, our current human-centric traffic management mechanisms will give way to hyper-efficient systems and...
Mark Van Middlesworth, Kurt M. Dresner, Peter Ston...
CAISE
2008
Springer
15 years 8 months ago
A New Paradigm for the Enactment and Dynamic Adaptation of Data-Driven Process Structures
Abstract. Industry is increasingly demanding IT support for large engineering processes, i.e., process structures consisting of hundreds up to thousands of processes. Developing a ...
Dominic Müller, Manfred Reichert, Joachim Her...