Sciweavers

251 search results - page 44 / 51
» Distributed algorithms for edge dominating sets
Sort
View
IPPS
2005
IEEE
15 years 3 months ago
Partial Clustering: Maintaining Connectivity in a Low Duty-Cycled Dense Wireless Sensor Network
— We consider a dense wireless sensor network where the radio transceivers of the sensor nodes are heavily duty-cycled in order to conserve energy. The chief purpose of the senso...
Chih-fan Hsin, Mingyan Liu
CORR
2010
Springer
164views Education» more  CORR 2010»
14 years 9 months ago
Schnyder decompositions for regular plane graphs and application to drawing
Schnyder woods are decompositions of simple triangulations into three edge-disjoint spanning trees crossing each other in a specific way. In this article, we define a generalizatio...
Olivier Bernardi, Éric Fusy
SCALESPACE
2005
Springer
15 years 3 months ago
Discrete Representation of Top Points via Scale Space Tessellation
In previous work, singular points (or top points) in the scale space representation of generic images have proven valuable for image matching. In this paper, we propose a construct...
Bram Platel, M. Fatih Demirci, Ali Shokoufandeh, L...
CP
2006
Springer
15 years 1 months ago
Dynamic Symmetry Breaking Restarted
ion of a given partial assignment of values to variables. Compared with other symmetry breaking techniques, the big advantage of dynamic symmetry breaking is that it can accommodat...
Daniel S. Heller, Meinolf Sellmann
SIROCCO
2008
14 years 11 months ago
Recovering the Long-Range Links in Augmented Graphs
The augmented graph model, as introduced by Kleinberg (STOC 2000), is an appealing model for analyzing navigability in social networks. Informally, this model is defined by a pair...
Pierre Fraigniaud, Emmanuelle Lebhar, Zvi Lotker