Sciweavers

4201 search results - page 112 / 841
» Our Users have Root!
Sort
View
SIAMCOMP
2008
167views more  SIAMCOMP 2008»
13 years 8 months ago
Approximation Algorithms for Data Placement Problems
We develop approximation algorithms for the problem of placing replicated data in arbitrary networks, where the nodes may both issue requests for data objects and have capacity fo...
Ivan D. Baev, Rajmohan Rajaraman, Chaitanya Swamy
SASN
2006
ACM
14 years 2 months ago
Attack-resilient hierarchical data aggregation in sensor networks
In a large sensor network, in-network data aggregation, i.e., combining partial results at intermediate nodes during message routing, significantly reduces the amount of communic...
Sankardas Roy, Sanjeev Setia, Sushil Jajodia
JIT
2004
Springer
204views Database» more  JIT 2004»
14 years 1 months ago
Ercatons: Thing-Oriented Programming
Thing-oriented programming (TP) is an emerging programming model which overcomes some of the limitations of current practice in software development in general and of object-orient...
Oliver Imbusch, Falk Langhammer, Guido von Walter
CHI
1999
ACM
14 years 17 days ago
A Better Mythology for System Design
The past decades have seen huge improvements in computer systems but these have proved difficult to translate into comparable improvements in the usability and social integration)...
Jed Harris, D. Austin Henderson Jr.
ICCAD
1997
IEEE
108views Hardware» more  ICCAD 1997»
14 years 14 days ago
Negative thinking by incremental problem solving: application to unate covering
We introduce a new technique to solve exactly a discrete optimization problem, based on the paradigm of “negative” thinking. The motivation is that when searching the space of...
Evguenii I. Goldberg, Luca P. Carloni, Tiziano Vil...