Sciweavers

4171 search results - page 192 / 835
» Choice numbers of graphs
Sort
View
ESA
2005
Springer
108views Algorithms» more  ESA 2005»
16 years 4 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...
CCR
2002
81views more  CCR 2002»
15 years 6 months ago
Rationalizing key design decisions in the ATM user plane
Any technology requires some number of key design decisions. In the case of the ATM user plane, the choices to use fixed length, 53 byte cells and virtual connections were unortho...
Daniel B. Grossman
HICSS
2008
IEEE
90views Biometrics» more  HICSS 2008»
16 years 1 months ago
Power System Extreme Event Detection: The Vulnerability Frontier
In this work we apply graph theoretic tools to provide a close bound on a frontier relating the number of line outages in a grid to the power disrupted by the outages. This fronti...
Bernard C. Lesieutre, Ali Pinar, Sandip Roy
EMMCVPR
2009
Springer
16 years 1 months ago
Multi-label Moves for MRFs with Truncated Convex Priors
Optimization with graph cuts became very popular in recent years. As more applications rely on graph cuts, different energy functions are being employed. Recent evaluation of optim...
Olga Veksler
SC
1995
ACM
15 years 10 months ago
Analysis of Multilevel Graph Partitioning
Recently, a number of researchers have investigated a class of algorithms that are based on multilevel graph partitioning that have moderate computational complexity, and provide ...
George Karypis, Vipin Kumar