Sciweavers

1453 search results - page 109 / 291
» A globally optimal algorithm for TTD-MDPs
Sort
View
ICDCS
2010
IEEE
14 years 1 months ago
Existence Theorems and Approximation Algorithms for Generalized Network Security Games
—Aspnes et al [2] introduced an innovative game for modeling the containment of the spread of viruses and worms (security breaches) in a network. In this model, nodes choose to i...
V. S. Anil Kumar, Rajmohan Rajaraman, Zhifeng Sun,...
ICDAR
2005
IEEE
14 years 2 months ago
Grouping Text Lines in Freeform Handwritten Notes
Handwritten text lines are prominent structures in freeform digital ink notes and their reliable detection is the foundation to a natural and intelligent interface for note editin...
Ming Ye, Herry Sutanto, Sashi Raghupathy, Chengyan...
VMV
2007
122views Visualization» more  VMV 2007»
13 years 10 months ago
An iterative framework for registration with reconstruction
The core of most registration algorithms aligns scan data by pairs, minimizing their relative distance. This local optimization must generally pass through a validation procedure t...
Thales Vieira, Adelailson Peixoto, Luiz Velho, Tho...
CN
2011
117views more  CN 2011»
13 years 4 months ago
Cross-layer design in multihop wireless networks
In this paper, we take a holistic approach to the protocol architecture design in multihop wireless networks. Our goal is to integrate various protocol layers into a rigorous fram...
Lijun Chen, Steven H. Low, John C. Doyle
GECCO
2008
Springer
124views Optimization» more  GECCO 2008»
13 years 10 months ago
Runtime analysis of binary PSO
We investigate the runtime of the Binary Particle Swarm Optimization (PSO) algorithm introduced by Kennedy and Eberhart (1997). The Binary PSO maintains a global best solution and...
Dirk Sudholt, Carsten Witt