Sciweavers

5326 search results - page 848 / 1066
» On what we can ensure
Sort
View
INFOCOM
2007
IEEE
16 years 25 days ago
Reliable Broadcast in Wireless Networks with Probabilistic Failures
We consider the problem of reliable broadcast in a wireless network in which nodes are prone to failure. In the failure mode considered in this paper, each node can fail independe...
Vartika Bhandari, Nitin H. Vaidya
ML
2006
ACM
103views Machine Learning» more  ML 2006»
16 years 15 days ago
Type-safe distributed programming for OCaml
Existing ML-like languages guarantee type-safety, ensuring memty and protecting the invariants of abstract types, but only within single executions of single programs. Distributed...
John Billings, Peter Sewell, Mark R. Shinwell, Rok...
ICCV
2005
IEEE
16 years 4 days ago
Mutual Information-Based 3D Surface Matching with Applications to Face Recognition and Brain Mapping
Face recognition and many medical imaging applications require the computation of dense correspondence vector fields that match one surface with another. In brain imaging, surfac...
Yalin Wang, Ming-Chang Chiang, Paul M. Thompson
MOBICOM
2005
ACM
16 years 2 days ago
Self-management in chaotic wireless deployments
Over the past few years, wireless networking technologies have made vast forays into our daily lives. Today, one can find 802.11 hardware and other personal wireless technology e...
Aditya Akella, Glenn Judd, Srinivasan Seshan, Pete...
SPAA
2003
ACM
15 years 11 months ago
Short length menger's theorem and reliable optical routing
In the minimum path coloring problem, we are given a graph and a set of pairs of vertices of the graph and we are asked to connect the pairs by colored paths in such a way that pa...
Amitabha Bagchi, Amitabh Chaudhary, Petr Kolman