Sciweavers

750 search results - page 128 / 150
» Reconstruction for Models on Random Graphs
Sort
View
GLOBECOM
2007
IEEE
14 years 4 months ago
On the Expected Connection Lifetime and Stochastic Resilience of Wireless Multi-Hop Networks
—To understand how node mobility and Byzantine node failures affect connectivity of wireless multi-hop networks, this paper investigates resilience of geometric random graphs to ...
Fei Xing, Wenye Wang
PET
2007
Springer
14 years 3 months ago
Anonymity in the Wild: Mixes on Unstructured Networks
Abstract. As decentralized computing scenarios get ever more popular, unstructured topologies are natural candidates to consider running mix networks upon. We consider mix network ...
Shishir Nagaraja
WEA
2005
Springer
119views Algorithms» more  WEA 2005»
14 years 3 months ago
On Symbolic Scheduling Independent Tasks with Restricted Execution Times
Ordered Binary Decision Diagrams (OBDDs) are a data structure for Boolean functions which supports many useful operations. It finds applications in CAD, model checking, and symbol...
Daniel Sawitzki
HT
1991
ACM
14 years 1 months ago
Implementing Hypertext Database Relationships through Aggregations and Exceptions
In order to combine hypertext with database facilities, we show how to extract an effective storage structure from given instance relationships. The schema of the structure recogn...
Yoshinori Hara, Arthur M. Keller, Gio Wiederhold
TCSV
2002
229views more  TCSV 2002»
13 years 9 months ago
Automatic segmentation of moving objects in video sequences: a region labeling approach
Abstract--The emerging video coding standard MPEG-4 enables various content-based functionalities for multimedia applications. To support such functionalities, as well as to improv...
Yaakov Tsaig, Amir Averbuch