Sciweavers

2542 search results - page 175 / 509
» Computing Cartograms with Optimal Complexity
Sort
View
110
Voted
SIGMOD
2010
ACM
323views Database» more  SIGMOD 2010»
15 years 5 months ago
Boosting spatial pruning: on optimal pruning of MBRs
Fast query processing of complex objects, e.g. spatial or uncertain objects, depends on efficient spatial pruning of the objects’ approximations, which are typically minimum bou...
Tobias Emrich, Hans-Peter Kriegel, Peer Kröge...
PLDI
2012
ACM
13 years 3 months ago
Adaptive input-aware compilation for graphics engines
While graphics processing units (GPUs) provide low-cost and efficient platforms for accelerating high performance computations, the tedious process of performance tuning required...
Mehrzad Samadi, Amir Hormati, Mojtaba Mehrara, Jan...
107
Voted
CDC
2008
IEEE
166views Control Systems» more  CDC 2008»
15 years 2 months ago
Distributed coverage verification in sensor networks without location information
In this paper, we present a series of distributed algorithms for coverage verification in sensor networks with no location information. We demonstrate how, in the absence of locali...
Alireza Tahbaz-Salehi, Ali Jadbabaie
137
Voted
JAPLL
2010
179views more  JAPLL 2010»
14 years 11 months ago
Tractable query answering and rewriting under description logic constraints
Answering queries over an incomplete database w.r.t. a set of constraints is an important computational task with applications in fields as diverse as information integration and ...
Héctor Pérez-Urbina, Boris Motik, Ia...
99
Voted
SASO
2010
IEEE
14 years 10 months ago
Designing Comprehensible Self-Organising Systems
Self-organising systems are a popular engineering concept for designing decentralised autonomic computing systems. They are able to find solutions in complex and versatile problem ...
Nicolas Höning, Han La Poutré