Sciweavers

4066 search results - page 54 / 814
» Almost Complete Sets
Sort
View
APN
2006
Springer
14 years 1 months ago
Complete Finite Prefixes of Symbolic Unfoldings of Safe Time Petri Nets
Abstract. Time Petri nets have proved their interest in modeling realtime concurrent systems. Their usual semantics is defined in term of firing sequences, which can be coded in a ...
Thomas Chatain, Claude Jard
ESA
2010
Springer
203views Algorithms» more  ESA 2010»
13 years 11 months ago
A Complete Characterization of Group-Strategyproof Mechanisms of Cost-Sharing
Abstract. We study the problem of designing group-strategyproof costsharing mechanisms. The players report their bids for getting serviced and the mechanism decides a set of player...
Emmanouil Pountourakis, Angelina Vidali
KIVS
2007
Springer
14 years 4 months ago
Routing and Broadcasting in Ad-Hoc Networks
In this paper, we introduce two protocols - a routing and a broadcasting protocol - for ad-hoc networks which are based on a new paradigm enabled by the broadcast property of the w...
Marc Heissenbüttel
ICIP
2004
IEEE
14 years 11 months ago
Complete 3-d models from video: a global approach
We address the automatic recovery of complete 3-D object models from video streams. Usually, complete 3-D models are built by fusing several depth maps, each computed from a small...
Bruno B. Gonçalves, Pedro M. Q. Aguiar
SIAMMAX
2010
164views more  SIAMMAX 2010»
13 years 4 months ago
Uniqueness of Low-Rank Matrix Completion by Rigidity Theory
The problem of completing a low-rank matrix from a subset of its entries is often encountered in the analysis of incomplete data sets exhibiting an underlying factor model with app...
Amit Singer, Mihai Cucuringu