Sciweavers

154 search results - page 18 / 31
» Exploiting Similarity of Subqueries for Complex Query Optimi...
Sort
View
BMCBI
2005
125views more  BMCBI 2005»
13 years 7 months ago
Query3d: a new method for high-throughput analysis of functional residues in protein structures
Background: The identification of local similarities between two protein structures can provide clues of a common function. Many different methods exist for searching for similar ...
Gabriele Ausiello, Allegra Via, Manuela Helmer-Cit...
DAGSTUHL
2004
13 years 9 months ago
The Priority R-Tree: A Practically Efficient and Worst-Case-Optimal R-Tree
We present the Priority R-tree, or PR-tree, which is the first R-tree variant that always answers a window query using O((N/B)1-1/d + T/B) I/Os, where N is the number of ddimensio...
Lars Arge, Mark de Berg, Herman J. Haverkort, Ke Y...
DASFAA
2004
IEEE
158views Database» more  DASFAA 2004»
13 years 11 months ago
A Cost Model for Spatial Intersection Queries on RI-Trees
Abstract. The efficient management of interval sequences represents a core requirement for many temporal and spatial database applications. With the Relational Interval Tree (RI-tr...
Hans-Peter Kriegel, Martin Pfeifle, Marco Pöt...
JCP
2007
181views more  JCP 2007»
13 years 7 months ago
Reducing Energy Consumption of Wireless Sensor Networks through Processor Optimizations
When the environmental conditions are stable, a typical Wireless Sensor Network (WSN) application may sense and process very similar or constant data values for long durations. Thi...
Gürhan Küçük, Can Basaran
STOC
2004
ACM
150views Algorithms» more  STOC 2004»
14 years 8 months ago
Typical properties of winners and losers in discrete optimization
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...
René Beier, Berthold Vöcking