Sciweavers

113 search results - page 12 / 23
» When can a graph form an orthogonal polyhedron
Sort
View
ESA
2005
Springer
108views Algorithms» more  ESA 2005»
14 years 27 days ago
Bootstrapping a Hop-Optimal Network in the Weak Sensor Model
Sensor nodes are very weak computers that get distributed at random on a surface. Once deployed, they must wake up and form a radio network. Sensor network bootstrapping research t...
Martin Farach-Colton, Rohan J. Fernandes, Miguel A...
SYNASC
2006
IEEE
106views Algorithms» more  SYNASC 2006»
14 years 1 months ago
A Quality Measure for Multi-Level Community Structure
Mining relational data often boils down to computing clusters, that is finding sub-communities of data elements forming cohesive sub-units, while being well separated from one an...
Maylis Delest, Jean-Marc Fedou, Guy Melanço...
ICCSA
2004
Springer
14 years 22 days ago
Searching for 2D Spatial Network Holes
Research involving different forms of networks, such as internet networks, social networks, and cellular networks, has increasingly become an important field of study. From this wo...
Femke Reitsma, Shane Engel
DIALM
2003
ACM
139views Algorithms» more  DIALM 2003»
14 years 18 days ago
dBBlue: low diameter and self-routing bluetooth scatternet
This paper addresses the problem of scatternet formation for singlehop Bluetooth based ad hoc networks, with minimal communication overhead. We adopt the well-known structure de B...
Wen-Zhan Song, Xiang-Yang Li, Yu Wang 0003, Weizha...
ATVA
2007
Springer
108views Hardware» more  ATVA 2007»
14 years 1 months ago
A New Approach to Bounded Model Checking for Branching Time Logics
Abstract. Bounded model checking (BMC) is a technique for overcoming the state explosion problem which has gained wide industrial acceptance. Bounded model checking is typically ap...
Rotem Oshman, Orna Grumberg