Sciweavers

2004 search results - page 394 / 401
» Sampling from large graphs
Sort
View
SENSYS
2006
ACM
14 years 3 months ago
Scalable data aggregation for dynamic events in sensor networks
Computing and maintaining network structures for efficient data aggregation incurs high overhead for dynamic events where the set of nodes sensing an event changes with time. Mor...
Kai-Wei Fan, Sha Liu, Prasun Sinha
SIGMETRICS
2005
ACM
147views Hardware» more  SIGMETRICS 2005»
14 years 3 months ago
Denial-of-service resilience in peer-to-peer file sharing systems
Peer-to-peer (p2p) file sharing systems are characterized by highly replicated content distributed among nodes with enormous aggregate resources for storage and communication. Th...
Dan Dumitriu, Edward W. Knightly, Aleksandar Kuzma...
FOCS
2002
IEEE
14 years 2 months ago
A Constant-Factor Approximation Algorithm for the Multicommodity
We present the first constant-factor approximation algorithm for network design with multiple commodities and economies of scale. We consider the rent-or-buy problem, a type of m...
Amit Kumar, Anupam Gupta, Tim Roughgarden
WCRE
2000
IEEE
14 years 2 months ago
A Structured Demonstration of Five Program Comprehension Tools: Lessons Learnt
The purpose of this panel is to report on a structured demonstration for comparing program comprehension tools. Five program comprehension tool designers applied their tools to a ...
Susan Elliott Sim, Margaret-Anne D. Storey, Andrea...
SMA
1999
ACM
106views Solid Modeling» more  SMA 1999»
14 years 2 months ago
Resolving non-uniqueness in design feature histories
Nearly all major commercial computer-aided design systems have adopted a feature-based design approach to solid modeling. Models are created via a sequence of operations which app...
Vincent A. Cicirello, William C. Regli