Sciweavers

1404 search results - page 144 / 281
» Optimization problems in multiple-interval graphs
Sort
View
CRYPTO
2006
Springer
159views Cryptology» more  CRYPTO 2006»
15 years 1 months ago
Asymptotically Optimal Two-Round Perfectly Secure Message Transmission
Abstract. The problem of perfectly secure message transmission concerns two synchronized non-faulty processors sender (S) and receiver (R) that are connected by a synchronous netwo...
Saurabh Agarwal, Ronald Cramer, Robbert de Haan
AAAI
2007
15 years 7 days ago
Filtering, Decomposition and Search Space Reduction for Optimal Sequential Planning
We present in this paper a hybrid planning system which combines constraint satisfaction techniques and planning heuristics to produce optimal sequential plans. It integrates its ...
Stéphane Grandcolas, C. Pain-Barre
WWW
2008
ACM
15 years 10 months ago
A graph-theoretic approach to webpage segmentation
We consider the problem of segmenting a webpage into visually and semantically cohesive pieces. Our approach is based on formulating an appropriate optimization problem on weighte...
Deepayan Chakrabarti, Ravi Kumar, Kunal Punera
ESA
2008
Springer
115views Algorithms» more  ESA 2008»
14 years 11 months ago
A New Approach to Exact Crossing Minimization
The crossing number problem is to find the smallest number of edge crossings necessary when drawing a graph into the plane. Eventhough the problem is NP-hard, we are interested in ...
Markus Chimani, Petra Mutzel, Immanuel M. Bomze
ICCV
2007
IEEE
15 years 12 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