Sciweavers

11160 search results - page 234 / 2232
» Incompleteness in a General Setting
Sort
View
COMMA
2006
15 years 7 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
153
Voted
SODA
2001
ACM
86views Algorithms» more  SODA 2001»
15 years 7 months ago
Pattern matching for sets of segments
In this paper we present algorithms for a number of problems in geometric pattern matching where the input consist of a collections of segments in the plane. Our work consists of ...
Alon Efrat, Piotr Indyk, Suresh Venkatasubramanian
ALGORITHMICA
2010
95views more  ALGORITHMICA 2010»
15 years 6 months ago
Homogeneous String Segmentation using Trees and Weighted Independent Sets
We divide a string into k segments, each with only one sort of symbols, so as to minimize the total number of exceptions. Motivations come from machine learning and data mining. F...
Peter Damaschke
TIP
2008
111views more  TIP 2008»
15 years 5 months ago
A Region Merging Prior for Variational Level Set Image Segmentation
In current level set image segmentation methods, the number of regions is assumed to known beforehand. As a result, it remains constant during the optimization of the objective fun...
Ismail Ben Ayed, Amar Mitiche
138
Voted
ALGORITHMICA
2004
130views more  ALGORITHMICA 2004»
15 years 5 months ago
The Power of Priority Algorithms for Facility Location and Set Cover
We apply and extend the priority algorithm framework introduced by Borodin, Nielsen, and Rackoff to define "greedy-like" algorithms for the (uncapacitated) facility locat...
Spyros Angelopoulos, Allan Borodin