Sciweavers

255 search results - page 7 / 51
» Approximate Tree Embedding Problem - An Algebraic Approach
Sort
View
IDEAS
2005
IEEE
137views Database» more  IDEAS 2005»
14 years 1 months ago
Order-Sensitive XML Query Processing over Relational Sources: An Algebraic Approach
The XML data is order-sensitive. The order problem, that is how ordered XML documents and order-sensitive queries over it can be efficiently supported when mapped into the unorde...
Ling Wang, Song Wang, Brian Murphy, Elke A. Runden...
AISC
2010
Springer
13 years 10 months ago
How to Correctly Prune Tropical Trees
We present tropical games, a generalization of combinatorial min-max games based on tropical algebras. Our model breaks the traditional symmetry of rational zero-sum games where pl...
Jean-Vincent Loddo, Luca Saiu
IPL
2002
118views more  IPL 2002»
13 years 7 months ago
Lower bounds for approximate polygon decomposition and minimum gap
We consider the problem of decomposing polygons (with holes) into various types of simpler polygons. We focus on the problem of partitioning a rectilinear polygon, with holes, int...
Joachim Gudmundsson, Thore Husfeldt, Christos Levc...
COMPGEOM
2008
ACM
13 years 9 months ago
Circular partitions with applications to visualization and embeddings
We introduce a hierarchical partitioning scheme of the Euclidean plane, called circular partitions. Such a partition consists of a hierarchy of convex polygons, each having small ...
Krzysztof Onak, Anastasios Sidiropoulos
AAAI
2006
13 years 9 months ago
Approximate Compilation for Embedded Model-based Reasoning
The use of embedded technology has become widespread. Many complex engineered systems comprise embedded features to perform self-diagnosis or self-reconfiguration. These features ...
Barry O'Sullivan, Gregory M. Provan