Sciweavers

675 search results - page 66 / 135
» Biased Range Trees
Sort
View
SIGIR
2004
ACM
15 years 10 months ago
Length normalization in XML retrieval
XML retrieval is a departure from standard document retrieval in which each individual XML element, ranging from italicized words or phrases to full blown articles, is a potential...
Jaap Kamps, Maarten de Rijke, Börkur Sigurbj&...
ADBIS
1994
Springer
137views Database» more  ADBIS 1994»
15 years 8 months ago
The Low-Level Support and Logging for Flexible Transactions
In this paper the ways of various types of transaction support in the buffer system of the storage system are considered. Support of active transaction tree as the mechanism for n...
Henrietta Dombrowska
DAGSTUHL
2008
15 years 6 months ago
Constraint Satisfaction Problems with Infinite Templates
Allowing templates with infinite domains greatly expands the range of problems that can be formulated as a non-uniform constraint satisfaction problem. It turns out that many CSPs ...
Manuel Bodirsky
GECCO
2010
Springer
169views Optimization» more  GECCO 2010»
15 years 8 months ago
Robust symbolic regression with affine arithmetic
We use affine arithmetic to improve both the performance and the robustness of genetic programming for symbolic regression. During evolution, we use affine arithmetic to analyze e...
Cassio Pennachin, Moshe Looks, João A. de V...
ICDE
2009
IEEE
144views Database» more  ICDE 2009»
16 years 6 months ago
Reachability Indexes for Relational Keyword Search
Due to its considerable ease of use, relational keyword search (R-KWS) has become increasingly popular. Its simplicity, however, comes at the cost of intensive query processing. Sp...
Alexander Markowetz, Yin Yang, Dimitris Papadias