Sciweavers

270 search results - page 30 / 54
» Partitioning into Sets of Bounded Cardinality
Sort
View
INFOVIS
2005
IEEE
14 years 2 months ago
PRISAD: A Partitioned Rendering Infrastructure for Scalable Accordion Drawing
We present PRISAD, the first generic rendering infrastructure for information visualization applications that use the accordion drawing technique: rubber-sheet navigation with gu...
James Slack, Kristian Hildebrand, Tamara Munzner
DCOSS
2005
Springer
14 years 2 months ago
A Distributed Greedy Algorithm for Connected Sensor Cover in Dense Sensor Networks
Abstract. Achieving optimal battery usage and prolonged network lifetime are two of the most fundamental issues in wireless sensor networks. By exploiting node and data redundancy ...
Amitabha Ghosh, Sajal K. Das
JHSN
2007
165views more  JHSN 2007»
13 years 8 months ago
Slack allocation techniques for intra-path load balancing
: Network resource provisioning techniques need to perform both inter-path and intra-path load balancing to maximize the network’s resource usage efficiency while supporting end...
Kartik Gopalan, Tzi-cker Chiueh, Yow-Jian Lin
DCC
2005
IEEE
14 years 8 months ago
The Combinatorics of Dom de Caen
We give an overview of some of the mathematical results of Dominique de Caen. These include a short proof of K?onig's theorem, results on Tur?an numbers, biclique partitions,...
Edwin R. van Dam
VLDB
1998
ACM
82views Database» more  VLDB 1998»
14 years 29 days ago
Reducing the Braking Distance of an SQL Query Engine
In a recent paper, we proposed adding a STOP AFTER clause to SQL to permit the cardinality of a query result to be explicitly limited by query writers and query tools. We demonstr...
Michael J. Carey, Donald Kossmann