Sciweavers

1431 search results - page 105 / 287
» The complexity of random ordered structures
Sort
View
COMGEO
2004
ACM
15 years 2 months ago
Expected time analysis for Delaunay point location
We consider point location in Delaunay triangulations with the aid of simple data structures. In particular, we analyze methods in which a simple data structure is used to first lo...
Luc Devroye, Christophe Lemaire, Jean-Michel Morea...
ICDE
2002
IEEE
140views Database» more  ICDE 2002»
16 years 4 months ago
Efficient Filtering of XML Documents with XPath Expressions
We propose a novel index structure, termed XTrie, that supports the efficient filtering of XML documents based on XPath expressions. Our XTrie index structure offers several novel...
Chee Yong Chan, Pascal Felber, Minos N. Garofalaki...
CORR
2007
Springer
104views Education» more  CORR 2007»
15 years 3 months ago
Sorting and Selection in Posets
Classical problems of sorting and searching assume an underlying linear ordering of the objects being compared. In this paper, we study a more general setting, in which some pairs...
Constantinos Daskalakis, Richard M. Karp, Elchanan...
ICCAD
1994
IEEE
137views Hardware» more  ICCAD 1994»
15 years 7 months ago
Dynamic scheduling and synchronization synthesis of concurrent digital systems under system-level constraints
We present in this paper a novel control synthesis technique for system-level specifications that are better described as a set of concurrent synchronous descriptions, their synch...
Claudionor José Nunes Coelho Jr., Giovanni ...
CP
2006
Springer
15 years 6 months ago
Compiling Constraint Networks into AND/OR Multi-valued Decision Diagrams (AOMDDs)
Abstract. Inspired by AND/OR search spaces for graphical models recently introduced, we propose to augment Ordered Decision Diagrams with AND nodes, in order to capture function de...
Robert Mateescu, Rina Dechter