Sciweavers

296 search results - page 45 / 60
» Bipartite Graphs as Models of Complex Networks
Sort
View
CORR
2010
Springer
152views Education» more  CORR 2010»
14 years 12 months ago
Deploying Wireless Networks with Beeps
Abstract. We present the discrete beeping communication model, which assumes nodes have minimal knowledge about their environment and severely limited communication capabilities. S...
Alejandro Cornejo, Fabian Kuhn
WDAG
2005
Springer
102views Algorithms» more  WDAG 2005»
15 years 5 months ago
Papillon: Greedy Routing in Rings
We study greedy routing over n nodes placed in a ring, with the distance between two nodes defined to be the clockwise or the absolute distance between them along the ring. Such ...
Ittai Abraham, Dahlia Malkhi, Gurmeet Singh Manku
PODC
2010
ACM
15 years 3 months ago
Distributed algorithms for edge dominating sets
An edge dominating set for a graph G is a set D of edges such that each edge of G is in D or adjacent to at least one edge in D. This work studies deterministic distributed approx...
Jukka Suomela
CVPR
2009
IEEE
16 years 6 months ago
Topology Dictionary with Markov Model for 3D Video Content-Based Skimming and Description
This paper presents a novel approach to skim and describe 3D videos. 3D video is an imaging technology which consists in a stream of 3D models in motion captured by a synchronized ...
Tony Tung (Kyoto University), Takashi Matsuyama (K...
INFORMS
1998
142views more  INFORMS 1998»
14 years 11 months ago
Distributed State Space Generation of Discrete-State Stochastic Models
High-level formalisms such as stochastic Petri nets can be used to model complex systems. Analysis of logical and numerical properties of these models often requires the generatio...
Gianfranco Ciardo, Joshua Gluckman, David M. Nicol