Sciweavers

1101 search results - page 134 / 221
» An Algorithm for the Graph Crossing Number Problem
Sort
View
ICCV
2007
IEEE
16 years 7 months ago
Capacity Scaling for Graph Cuts in Vision
Capacity scaling is a hierarchical approach to graph representation that can improve theoretical complexity and practical efficiency of max-flow/min-cut algorithms. Introduced by ...
Olivier Juan, Yuri Boykov
WINET
2010
185views more  WINET 2010»
15 years 3 months ago
TDMA scheduling algorithms for wireless sensor networks
Abstract Algorithms for scheduling TDMA transmissions in multi-hop networks usually determine the smallest length conflict-free assignment of slots in which each link or node is a...
Sinem Coleri Ergen, Pravin Varaiya
137
Voted
JAIR
2007
106views more  JAIR 2007»
15 years 5 months ago
Solution-Guided Multi-Point Constructive Search for Job Shop Scheduling
Solution-Guided Multi-Point Constructive Search (SGMPCS) is a novel constructive search technique that performs a series of resource-limited tree searches where each search begins...
J. Christopher Beck
IJCV
2012
13 years 7 months ago
Minimizing Energies with Hierarchical Costs
Abstract Computer vision is full of problems elegantly expressed in terms of energy minimization. We characterize a class of energies with hierarchical costs and propose a novel hi...
Andrew Delong, Lena Gorelick, Olga Veksler, Yuri B...
158
Voted
FCS
2009
15 years 2 months ago
The Importance of Symmetric Representation
- A representation for a set is defined to be symmetric if the space required for the representation of the set is the same as the space required for representation of the set'...
Thomas O'Neil