Sciweavers

6274 search results - page 179 / 1255
» From query complexity to computational complexity
Sort
View
CISS
2008
IEEE
15 years 11 months ago
Distributed computation of a sparse cover in sensor networks without location information
— In this paper, we present a distributed algorithm for detecting redundancies in a sensor network with no location information. We demonstrate how, in the absence of localizatio...
Alireza Tahbaz-Salehi, Ali Jadbabaie
COMPLEXITY
2006
144views more  COMPLEXITY 2006»
15 years 4 months ago
BML revisited: Statistical physics, computer simulation, and probability
Statistical physics, computer simulation and discrete mathematics are intimately related through the study of shared lattice models. These models lie at the foundation of all thre...
Raissa M. D'Souza
DAWAK
2005
Springer
15 years 10 months ago
Automatic Selection of Bitmap Join Indexes in Data Warehouses
The queries defined on data warehouses are complex and use several join operations that induce an expensive computational cost. This cost becomes even more prohibitive when querie...
Kamel Aouiche, Jérôme Darmont, Omar B...
ICDE
2001
IEEE
206views Database» more  ICDE 2001»
16 years 5 months ago
Cache-Aware Query Routing in a Cluster of Databases
We investigate query routing techniques in a cluster of databases for a query-dominant environment. The objective is to decrease query response time. Each component of the cluster...
Uwe Röhm, Klemens Böhm, Hans-Jörg S...
PODS
2009
ACM
134views Database» more  PODS 2009»
16 years 5 months ago
Equivalence of nested queries with mixed semantics
We consider the problem of deciding query equivalence for a conjunctive language in which queries output complex objects composed from a mixture of nested, unordered collection ty...
David DeHaan