Sciweavers

1070 search results - page 89 / 214
» Benchmarking Adaptive Indexing
Sort
View
133
Voted
EKAW
2008
Springer
15 years 5 months ago
Ontological Profiles in Enterprise Search
Ontology-driven search applications use ontological concepts either to index documents or to guide and understand the users. Since ontologies by nature are domain-dependent and app...
Geir Solskinnsbakk, Jon Atle Gulla
IPM
2007
114views more  IPM 2007»
15 years 3 months ago
s-grams: Defining generalized n-grams for information retrieval
For European languages, n-gram has proved to be the cost effective alternative to morphological processing during indexing task and it has been studied and analyzed extensively us...
Anni Järvelin, Antti Järvelin, Kalervo J...
PPOPP
2010
ACM
16 years 22 days ago
Application heartbeats for software performance and health
Adaptive, or self-aware, computing has been proposed to help application programmers confront the growing complexity of multicore software development. However, existing approache...
Henry Hoffmann, Jonathan Eastep, Marco D. Santambr...
GECCO
2005
Springer
15 years 9 months ago
Intelligent exploration method for XCS
Exploration/Exploitation equilibrium is one of the most challenging issues in reinforcement learning area as well as learning classifier systems such as XCS. In this paper1 , an i...
Ali Hamzeh, Adel Rahmani
207
Voted
ICDE
1999
IEEE
106views Database» more  ICDE 1999»
16 years 4 months ago
Processing Operations with Restrictions in RDBMS without External Sorting: The Tetris Algorithm
Most operations of the relational algebra or SQL require a sorted stream of tuples for efficient processing. Therefore, processing complex relational queries relies on efficient a...
Volker Markl, Martin Zirkel, Rudolf Bayer