Sciweavers

395 search results - page 66 / 79
» Towards a theory of search queries
Sort
View
PODS
2006
ACM
216views Database» more  PODS 2006»
14 years 7 months ago
Cache-oblivious string B-trees
B-trees are the data structure of choice for maintaining searchable data on disk. However, B-trees perform suboptimally ? when keys are long or of variable length, ? when keys are...
Michael A. Bender, Martin Farach-Colton, Bradley C...
CIKM
2007
Springer
14 years 1 months ago
Combining resources with confidence measures for cross language information retrieval
Query translation in Cross Language Information Retrieval (CLIR) can be performed using multiple resources. Previous attempts to combine different translation resources use simple...
Youssef Kadri, Jian-Yun Nie
SIGIR
2005
ACM
14 years 1 months ago
Probabilistic hyperspace analogue to language
Song and Bruza [6] introduce a framework for Information Retrieval(IR) based on Gardenfor’s three tiered cognitive model; Conceptual Spaces[4]. They instantiate a conceptual spa...
Leif Azzopardi, Mark Girolami, Malcolm Crowe
CIKM
2007
Springer
14 years 1 months ago
Structure and semantics for expressive text kernels
Several problems in text categorization are too hard to be solved by standard bag-of-words representations. Work in kernel-based learning has approached this problem by (i) consid...
Stephan Bloehdorn, Alessandro Moschitti
GECCO
2006
Springer
181views Optimization» more  GECCO 2006»
13 years 11 months ago
Robustness in cooperative coevolution
Though recent analysis of traditional cooperative coevolutionary algorithms (CCEAs) casts doubt on their suitability for static optimization tasks, our experience is that the algo...
R. Paul Wiegand, Mitchell A. Potter