Sciweavers

212 search results - page 14 / 43
» Complexity Parameters for First-Order Classes
Sort
View
ICIP
2001
IEEE
16 years 4 months ago
Closed surface reconstruction in X-ray tomography
We study the 3D reconstruction of a binary scene from X-ray tomographic data. In the special case of a compact and uniform object lying in a uniform background, the scene is entir...
Ali Mohammad-Djafari, Charles Soussen
FSTTCS
2010
Springer
15 years 13 days ago
The effect of girth on the kernelization complexity of Connected Dominating Set
In the Connected Dominating Set problem we are given as input a graph G and a positive integer k, and are asked if there is a set S of at most k vertices of G such that S is a dom...
Neeldhara Misra, Geevarghese Philip, Venkatesh Ram...
RANDOM
2001
Springer
15 years 6 months ago
Proclaiming Dictators and Juntas or Testing Boolean Formulae
We consider the problem of determining whether a given function ¢ £ ¤¥ ¦ §¨©  ¤¥ ¦ §¨ belongs to a certain class of Boolean functions  or whether it is far from the...
Michal Parnas, Dana Ron, Alex Samorodnitsky
ECAI
2008
Springer
15 years 4 months ago
Towards Efficient Belief Update for Planning-Based Web Service Composition
At the "functional level", Semantic Web Services (SWS) are described akin to planning operators, with preconditions and effects relative to an ontology; the ontology prov...
Jörg Hoffmann
APPROX
2008
Springer
75views Algorithms» more  APPROX 2008»
15 years 4 months ago
On the Query Complexity of Testing Orientations for Being Eulerian
We consider testing directed graphs for being Eulerian in the orientation model introduced in [15]. Despite the local nature of the property of being Eulerian, it turns out to be ...
Eldar Fischer, Oded Lachish, Ilan Newman, Arie Mat...