Sciweavers

4229 search results - page 582 / 846
» On the Optimality of Spiral Search
Sort
View
SIGMOD
2009
ACM
202views Database» more  SIGMOD 2009»
16 years 7 months ago
ZStream: a cost-based query processor for adaptively detecting composite events
Composite (or Complex) event processing (CEP) systems search sequences of incoming events for occurrences of userspecified event patterns. Recently, they have gained more attentio...
Yuan Mei, Samuel Madden
COMPGEOM
2009
ACM
16 years 1 months ago
A general approach for cache-oblivious range reporting and approximate range counting
We present cache-oblivious solutions to two important variants of range searching: range reporting and approximate range counting. Our main contribution is a general approach for ...
Peyman Afshani, Chris H. Hamilton, Norbert Zeh
HM
2007
Springer
137views Optimization» more  HM 2007»
16 years 25 days ago
A Hybrid VNS for Connected Facility Location
The connected facility location (ConFL) problem generalizes the facility location problem and the Steiner tree problem in graphs. Given a graph G = (V, E), a set of customers D ⊆...
Ivana Ljubic
LCN
2005
IEEE
16 years 8 days ago
Simulated Annealing based Localization in Wireless Sensor Network
— In this paper, we describe a novel localization method for ad hoc wireless sensor networks. Accurate selforganization and localization is an essential characteristic of high pe...
Anushiya A. Kannan, Guoqiang Mao, Branka Vucetic
VLDB
1997
ACM
97views Database» more  VLDB 1997»
15 years 10 months ago
The Complexity of Transformation-Based Join Enumeration
Query optimizers that explore a search space exhaustively using transformation rules usually apply all possible rules on each alternative, and stop when no new information is prod...
Arjan Pellenkoft, César A. Galindo-Legaria,...