Sciweavers

LATIN
2004
Springer
14 years 5 months ago
Querying Priced Information in Databases: The Conjunctive Case
Eduardo Sany Laber, Renato Carmo, Yoshiharu Kohaya...
LATIN
2004
Springer
14 years 5 months ago
Rooted Maximum Agreement Supertrees
Jesper Jansson, Joseph H.-K. Ng, Kunihiko Sadakane...
LATIN
2004
Springer
14 years 5 months ago
The Complexity of Finding Top-Toda-Equivalence-Class Members
Lane A. Hemaspaandra, Mitsunori Ogihara, Mohammed ...
LATIN
2004
Springer
14 years 5 months ago
Distributed Games and Distributed Control for Asynchronous Systems
Abstract. We introduce distributed games over asynchronous transition systems to model a distributed controller synthesis problem. A game involves two teams and is not turn-based: ...
Paul Gastin, Benjamin Lerman, Marc Zeitoun
LATIN
2004
Springer
14 years 5 months ago
Rotation and Lighting Invariant Template Matching
We address the problem of searching for a two-dimensional pattern in a two-dimensional text (or image), such that the pattern can be found even if it appears rotated and it is bri...
Kimmo Fredriksson, Veli Mäkinen, Gonzalo Nava...
LATIN
2004
Springer
14 years 5 months ago
Embracing the Giant Component
Consider a game in which edges of a graph are provided a pair at a time, and the player selects one edge from each pair, attempting to construct a graph with a component as large ...
Abraham Flaxman, David Gamarnik, Gregory B. Sorkin
LATIN
2004
Springer
14 years 5 months ago
Global Synchronization in Sensornets
Time synchronization is necessary in many distributed systems, but achieving synchronization in sensornets, which combine stringent precision requirements with severe resource con...
Jeremy Elson, Richard M. Karp, Christos H. Papadim...
LATIN
2004
Springer
14 years 5 months ago
On the Competitiveness of AIMD-TCP within a General Network
This paper presents a new mathematical model of AIMD (Additive Increase Multiplicative Decrease) TCP for general networks that we believe is better than those previously used when...
Jeff Edmonds
LATIN
2004
Springer
14 years 5 months ago
Generating Maximal Independent Sets for Hypergraphs with Bounded Edge-Intersections
Given a finite set V , and integers k ≥ 1 and r ≥ 0, denote by A(k, r) the class of hypergraphs A ⊆ 2V with (k, r)-bounded intersections, i.e. in which the intersection of a...
Endre Boros, Khaled M. Elbassioni, Vladimir Gurvic...
LATIN
2004
Springer
14 years 5 months ago
Bidimensional Parameters and Local Treewidth
For several graph-theoretic parameters such as vertex cover and dominating set, it is known that if their sizes are bounded by k then the treewidth of the graph is bounded by some ...
Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Ha...