Sciweavers

1187 search results - page 135 / 238
» Graph-Based Procedural Abstraction
Sort
View
IPCO
2008
91views Optimization» more  IPCO 2008»
15 years 3 months ago
New Geometry-Inspired Relaxations and Algorithms for the Metric Steiner Tree Problem
Abstract. Determining the integrality gap of the bidirected cut relaxation for the metric Steiner tree problem, and exploiting it algorithmically, is a long-standing open problem. ...
Deeparnab Chakrabarty, Nikhil R. Devanur, Vijay V....
123
Voted
COMMA
2006
15 years 3 months ago
Computing Preferred Extensions for Argumentation Systems with Sets of Attacking Arguments
The hitherto most abstract, and hence general, argumentation system, is the one described by Dung in a paper from 1995. This framework does not allow for joint attacks on arguments...
Søren Holbech Nielsen, Simon Parsons
ICONIP
2004
15 years 3 months ago
Variational Information Maximization for Neural Coding
Abstract. Mutual Information (MI) is a long studied measure of coding efficiency, and many attempts to apply it to population coding have been made. However, this is a computationa...
Felix V. Agakov, David Barber
142
Voted
DICTA
2003
15 years 3 months ago
A Model Set Based Object Segmentation Method Using Level Set Approach
Abstract. A novel approach for model set based object segmentation is described. The proposed method enables the using of a model set to guide the object segmentation. The object s...
Xun Wang, Zhigang Peng, Feng Gao, William G. Wee
PUK
2000
15 years 3 months ago
Heuristic Search Planning with BDDs
Abstract. In this paper we study traditional and enhanced BDDbased exploration procedures capable of handling large planning problems. On the one hand, reachability analysis and mo...
Stefan Edelkamp