Sciweavers

11949 search results - page 315 / 2390
» Some results on (a:b)-choosability
Sort
View
MP
2007
91views more  MP 2007»
15 years 1 months ago
Set Intersection Theorems and Existence of Optimal Solutions
The question of nonemptiness of the intersection of a nested sequence of closed sets is fundamental in a number of important optimization topics, including the existence of optima...
Dimitri P. Bertsekas, Paul Tseng
114
Voted
DGCI
2005
Springer
15 years 7 months ago
Algorithms for the Topological Watershed
The watershed transformation is an efficient tool for segmenting grayscale images. An original approach to the watershed [1,9] consists in modifying the original image by lowering...
Michel Couprie, Laurent Najman, Gilles Bertrand
JELIA
2010
Springer
15 years 6 days ago
Parametrized Logic Programming
Traditionally, a logic program is built up to reason about atomic first-order formulas. The key idea of parametrized logic programming is that, instead of atomic first-order form...
Ricardo Gonçalves, José Júlio...
LICS
2010
IEEE
15 years 5 days ago
The Emptiness Problem for Tree Automata with Global Constraints
We define tree automata with global constraints (TAGC), generalizing the well-known class of tree automata with global equality and disequality constraints [14] (TAGED). TAGC can...
Luis Barguñó, Carles Creus, Guillem ...
MST
2010
98views more  MST 2010»
15 years 5 days ago
Why Almost All k-Colorable Graphs Are Easy to Color
Coloring a k-colorable graph using k colors (k ≥ 3) is a notoriously hard problem. Considering average case analysis allows for better results. In this work we consider the unif...
Amin Coja-Oghlan, Michael Krivelevich, Dan Vilench...