Sciweavers

759 search results - page 65 / 152
» Optimal Graph Search with Iterated Graph Cuts
Sort
View
AAAI
2006
14 years 11 months ago
Memory Intensive Branch-and-Bound Search for Graphical Models
AND/OR search spaces have recently been introduced as a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is its sens...
Radu Marinescu 0002, Rina Dechter
ICCV
2001
IEEE
15 years 11 months ago
Segmentation with Pairwise Attraction and Repulsion
We propose a method of image segmentation by integrating pairwise attraction and directional repulsion derived from local grouping and figure-ground cues. These two kinds of pairw...
Stella X. Yu, Jianbo Shi
WEA
2009
Springer
111views Algorithms» more  WEA 2009»
15 years 4 months ago
A Heuristic for Fair Correlation-Aware Resource Placement
Abstract. The configuration of network resources greatly impacts the communication overhead for data intensive tasks and constitutes a critical problem in the design and maintenan...
Raouf Boutaba, Martin Karsten, Maxwell Young
IJCAI
2007
14 years 11 months ago
State Space Search for Risk-Averse Agents
We investigate search problems under risk in statespace graphs, with the aim of finding optimal paths for risk-averse agents. We consider problems where uncertainty is due to the...
Patrice Perny, Olivier Spanjaard, Louis-Xavier Sto...
ICASSP
2008
IEEE
15 years 4 months ago
Graph laplacian for interactive image retrieval
Interactive image search or relevance feedback is the process which helps a user refining his query and finding difficult target categories. This consists in a step-by-step lab...
Hichem Sahbi, Patrick Etyngier, Jean-Yves Audibert...