Sciweavers

1650 search results - page 30 / 330
» The HOM problem is decidable
Sort
View

Presentation
945views
12 years 1 months ago
A Decentralized Method for Maximizing k-coverage Lifetime in WSNs
In this paper, we propose a decentralized method for maximizing lifetime of data collection wireless sensor networks (WSNs) by making minimal number of nodes operate and putting ot...
FUN
2007
Springer
85views Algorithms» more  FUN 2007»
13 years 11 months ago
Efficient Algorithms for the Spoonerism Problem
A spoonerism is a sentence in some natural language where the swapping of two letters results in a new sentence with a different meaning. In this paper, we give some efficient algo...
Hans-Joachim Böckenhauer, Juraj Hromkovic, Ri...
GD
2009
Springer
13 years 11 months ago
Complexity of Some Geometric and Topological Problems
We show that recognizing intersection graphs of convex sets has the same complexity as deciding truth in the existential theory of the reals. Comparing this to similar results on t...
Marcus Schaefer
ASIAN
2009
Springer
299views Algorithms» more  ASIAN 2009»
13 years 8 months ago
Deducibility Constraints
In their work on tractable deduction systems, D. McAllester and later D. Basin and H. Ganzinger have identified a property of inference systems (the locality property) that ensures...
Sergiu Bursuc, Hubert Comon-Lundh, Stéphani...
SOFSEM
2010
Springer
13 years 5 months ago
Approximate Structural Consistency
Abstract. We consider documents as words and trees on some alphabet and study how to compare them with some regular schemas on an alphabet . Given an input document I, we decide ...
Michel de Rougemont, Adrien Vieilleribière