Sciweavers

116 search results - page 16 / 24
» Fundamental Network Processor Performance Bounds
Sort
View
INFOCOM
2007
IEEE
14 years 1 months ago
Separability and Topology Control of Quasi Unit Disk Graphs
— A deep understanding of the structural properties of wireless networks is critical for evaluating the performance of network protocols and improving their designs. Many protoco...
Jianer Chen, Anxiao Jiang, Iyad A. Kanj, Ge Xia, F...
PODC
2005
ACM
14 years 8 days ago
Routing complexity of faulty networks
One of the fundamental problems in distributed computing is how to efficiently perform routing in a faulty network in which each link fails with some probability. This paper inves...
Omer Angel, Itai Benjamini, Eran Ofek, Udi Wieder
SIGSOFT
2010
ACM
13 years 4 months ago
Multiplicity computing: a vision of software engineering for next-generation computing platform applications
New technologies have recently emerged to challenge the very nature of computing: multicore processors, virtualized operating systems and networks, and data-center clouds. One can...
Cristian Cadar, Peter Pietzuch, Alexander L. Wolf
SENSYS
2009
ACM
14 years 1 months ago
Optimal clock synchronization in networks
Having access to an accurate time is a vital building block in all networks; in wireless sensor networks even more so, because wireless media access or data fusion may depend on i...
Christoph Lenzen, Philipp Sommer, Roger Wattenhofe...
CORR
2006
Springer
109views Education» more  CORR 2006»
13 years 6 months ago
On Conditional Branches in Optimal Decision Trees
The decision tree is one of the most fundamental ing abstractions. A commonly used type of decision tree is the alphabetic binary tree, which uses (without loss of generality) &quo...
Michael B. Baer