Sciweavers

427 search results - page 77 / 86
» A Graph Based Synthesis Algorithm for Solving CSPs
Sort
View
CVPR
2010
IEEE
13 years 10 months ago
A Study on Continuous Max-Flow and Min-Cut Approaches
Abstract. This work addresses a class of total-variation based multilabeling problems over a spatially continuous image domain, where the data fidelity term can be any bounded fun...
Jing Yuan, Egil Bae, Xuecheng Tai
JAIR
2006
179views more  JAIR 2006»
13 years 7 months ago
The Fast Downward Planning System
Fast Downward is a classical planning system based on heuristic search. It can deal with general deterministic planning problems encoded in the propositional fragment of PDDL2.2, ...
Malte Helmert
ISAAC
2004
Springer
137views Algorithms» more  ISAAC 2004»
14 years 1 months ago
The Polymatroid Steiner Problems
The Steiner tree problem asks for a minimum cost tree spanning a given set of terminals S ⊆ V in a weighted graph G = (V, E, c), c : E → R+ . In this paper we consider a genera...
Gruia Calinescu, Alexander Zelikovsky
MIDDLEWARE
2007
Springer
14 years 1 months ago
A piggybacking approach to reduce overhead in sensor network gossiping
Many wireless sensor network protocols are employing gossipbased message dissemination, where nodes probabilistically forward messages, to reduce message overhead. We are concerne...
Ercan Ucan, Nathanael Thompson, Indranil Gupta
MM
2005
ACM
171views Multimedia» more  MM 2005»
14 years 1 months ago
Semantic manifold learning for image retrieval
Learning the user’s semantics for CBIR involves two different sources of information: the similarity relations entailed by the content-based features, and the relevance relatio...
Yen-Yu Lin, Tyng-Luh Liu, Hwann-Tzong Chen