Sciweavers

2542 search results - page 417 / 509
» Computing Cartograms with Optimal Complexity
Sort
View
ICC
2011
IEEE
201views Communications» more  ICC 2011»
12 years 9 months ago
Survivable Optical Grid Dimensioning: Anycast Routing with Server and Network Failure Protection
Abstract—Grids can efficiently deal with challenging computational and data processing tasks which cutting edge science is generating today. So-called e-Science grids cope with ...
Chris Develder, Jens Buysse, Ali Shaikh, Brigitte ...
COCO
2003
Springer
118views Algorithms» more  COCO 2003»
14 years 3 months ago
Lower bounds for predecessor searching in the cell probe model
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
Pranab Sen
EDBT
2009
ACM
175views Database» more  EDBT 2009»
14 years 4 months ago
Towards materialized view selection for distributed databases
Materialized views (MV) can significantly improve the query performance of relational databases. In this paper, we consider MVs to optimize complex scenarios where many heterogen...
Leonardo Weiss Ferreira Chaves, Erik Buchmann, Fab...
GECCO
2009
Springer
151views Optimization» more  GECCO 2009»
14 years 4 months ago
Evolution of functional specialization in a morphologically homogeneous robot
A central tenet of embodied artificial intelligence is that intelligent behavior arises out of the coupled dynamics between an agent’s body, brain and environment. It follows t...
Joshua S. Auerbach, Josh C. Bongard
VLDB
2007
ACM
182views Database» more  VLDB 2007»
14 years 4 months ago
Continuous Queries in Oracle
This paper describes Continuous Queries (CQ) in Oracle RDBMS, a feature that incorporates stream and complex event processing into an RDBMS, the first such attempt in commercial d...
Sankar Subramanian, Srikanth Bellamkonda, Hua-Gang...