Sciweavers

3625 search results - page 603 / 725
» On choosing
Sort
View
COCOA
2007
Springer
16 years 1 months ago
On the Complexity of Some Colorful Problems Parameterized by Treewidth
Abstract. We study the complexity of several coloring problems on graphs, parameterized by the treewidth t of the graph: (1) The list chromatic number χl(G) of a graph G is defin...
Michael R. Fellows, Fedor V. Fomin, Daniel Lokshta...
COLT
2007
Springer
16 years 1 months ago
Resource-Bounded Information Gathering for Correlation Clustering
We present a new class of problems, called resource-bounded information gathering for correlation clustering. Our goal is to perform correlation clustering under circumstances in w...
Pallika Kanani, Andrew McCallum
DAARC
2007
Springer
137views Algorithms» more  DAARC 2007»
16 years 1 months ago
Anaphora Resolution as Equality by Default
The resolution of anaphora is dependent on a number of factors discussed in the literature: syntactic parallelism, topicality, etc. A system that attempts to resolve anaphora will ...
Ariel Cohen
ESWS
2007
Springer
16 years 1 months ago
The NExT System: Towards True Dynamic Adaptations of Semantic Web Service Compositions
Traditional process support systems typically offer a static composition of atomic tasks to more powerful services. In the real world, however, processes change over time: busines...
Abraham Bernstein, Michael Dänzer
EVOW
2007
Springer
16 years 1 months ago
Overcompressing JPEG Images with Evolution Algorithms
Abstract. Overcompression is the process of post-processing compressed images to gain either further size reduction or improved quality. This is made possible by the fact that the ...
Jacques Lévy Véhel, Franklin Mendivi...