Sciweavers

153 search results - page 17 / 31
» Minimum cost subpartitions in graphs
Sort
View
DAGM
2007
Springer
15 years 10 months ago
Intrinsic Mean for Semi-metrical Shape Retrieval Via Graph Cuts
We address the problem of describing the mean object for a set of planar shapes in the case that the considered dissimilarity measures are semi-metrics, i.e. in the case that the t...
Frank R. Schmidt, Eno Töppe, Daniel Cremers, ...
FLAIRS
2003
15 years 7 months ago
Identifying Inhabitants of an Intelligent Environment Using a Graph-Based Data Mining System
The goal of the MavHome smart home project is to build an intelligent home environment that is aware of its inhabitants and their activities. Such a home is designed to provide ma...
Ritesh Mehta, Diane J. Cook, Lawrence B. Holder
MICCAI
2000
Springer
15 years 9 months ago
Interactive Organ Segmentation Using Graph Cuts
Abstract. An N-dimensional image is divided into "object" and "background" segments using a graph cut approach. A graph is formed by connecting all pairs of nei...
Yuri Boykov, Marie-Pierre Jolly
WINET
2010
128views more  WINET 2010»
15 years 4 months ago
Distributed algorithms for lifetime maximization in sensor networks via Min-Max spanning subgraphs
We consider the problem of static transmission-power assignment for lifetime maximization of a wireless sensor network with stationary nodes operating in a data-gathering scenario...
Harri Haanpää, André Schumacher, ...
ESA
2006
Springer
111views Algorithms» more  ESA 2006»
15 years 9 months ago
Path Hitting in Acyclic Graphs
An instance of the path hitting problem consists of two families of paths, D and H, in a common undirected graph, where each path in H is associated with a non-negative cost. We r...
Ojas Parekh, Danny Segev