Sciweavers

4276 search results - page 345 / 856
» Computability of Probability Distributions and Distribution ...
Sort
View
SRDS
2006
IEEE
16 years 18 days ago
Reliably Executing Tasks in the Presence of Untrusted Entities
In this work we consider a distributed system formed by a master processor and a collection of n processors (workers) that can execute tasks; worker processors are untrusted and m...
Antonio Fernández, Luis López, Agust...
ISPAN
1999
IEEE
15 years 11 months ago
Sparse Networks Tolerating Random Faults
A network G is called random-fault-tolerant (RFT) network for a network G if G contains a fault-free isomorphic copy of G with high probability even if each processor fails indepe...
Toshinori Yamada, Shuichi Ueno
CVPR
2000
IEEE
16 years 8 months ago
Structure from Motion without Correspondence
A method is presented to recover 3D scene structure and camera motion from multiple images without the need for correspondence information. The problem is framed as finding the ma...
Frank Dellaert, Steven M. Seitz, Charles E. Thorpe...
CSR
2007
Springer
16 years 24 days ago
Maximal Intersection Queries in Randomized Graph Models
Consider a family of sets and a single set, called query set. How can one quickly find a member of the family which has a maximal intersection with the query set? Strict time cons...
Benjamin Hoffmann, Yury Lifshits, Dirk Nowotka
ICDCS
2006
IEEE
16 years 20 days ago
Detecting MAC Layer Back-off Timer Violations in Mobile Ad Hoc Networks
In IEEE 802.11 based ad hoc networks, by simply manipulating the back-off timers and/or wait times prior to transmission, malicious nodes can cause a drastically reduced allocatio...
Venkata Nishanth Lolla, Lap Kong Law, Srikanth V. ...