Sciweavers

2168 search results - page 150 / 434
» Randomized Algorithms and Complexity Theory
Sort
View
119
Voted
IPSN
2007
Springer
15 years 9 months ago
The worst-case capacity of wireless sensor networks
The key application scenario of wireless sensor networks is data gathering: sensor nodes transmit data, possibly in a multi-hop fashion, to an information sink. The performance of...
Thomas Moscibroda
94
Voted
ICCAD
2002
IEEE
104views Hardware» more  ICCAD 2002»
16 years 9 days ago
A new enhanced SPFD rewiring algorithm
This paper presents an in-depth study of the theory and algorithms for the SPFD-based (Set of Pairs of Functions to be Distinguished) rewiring, and explores the flexibility in the...
Jason Cong, Joey Y. Lin, Wangning Long
131
Voted
ICPP
2006
IEEE
15 years 9 months ago
Designing Multithreaded Algorithms for Breadth-First Search and st-connectivity on the Cray MTA-2
stractions are extensively used to understand and solve challenging computational problems in various scientific and engineering domains. They have particularly gained prominence...
David A. Bader, Kamesh Madduri
PODS
2010
ACM
181views Database» more  PODS 2010»
15 years 8 months ago
Schema design for XML repositories: complexity and tractability
Abiteboul et al. initiated the systematic study of distributed XML documents consisting of several logical parts, possibly located on different machines. The physical distributio...
Wim Martens, Matthias Niewerth, Thomas Schwentick
116
Voted
ICCSA
2010
Springer
15 years 5 months ago
Efficient Algorithms for the 2-Center Problems
This paper achieves O(n3 log log n/ log n) time for the 2center problems on a directed graph with non-negative edge costs under the conventional RAM model where only arithmetic ope...
Tadao Takaoka