962 search results - page 80 / 193 » Efficient Algorithms for Eulerian Extension |
107
click to vote
PC
2006
14 years 11 months ago
2006
Trees are important datatypes that are often used in representing structured data such as XML. Though trees are widely used in sequential programming, it is hard to write efficien...
184
click to vote
VLDB
2007
ACM
16 years 3 days ago
2007
ACM
We investigate the problem of how to evaluate efficiently a collection of shortest path queries on massive graphs that are too big to fit in the main memory. To evaluate a shortes...
118
click to vote
PODS
2003
ACM
16 years 9 hour ago
2003
ACM
Full disjunctions are an associative extension of the outerjoin operator to an arbitrary number of relations. Their main advantage is the ability to maximally combine data from di...
115
click to vote
TSE
2010
14 years 10 months ago
2010
—In the past, researchers have developed specialized programs to aid programmers in detecting concurrent programming errors such as deadlocks, livelocks, starvation, and data rac...
120
click to vote
ICIP
2008
IEEE
16 years 1 months ago
2008
IEEE
Reliable segmentation and motion tracking algorithms are required to achieve gesture detection and tracking for human-machine interaction. In this paper we present an efficient me...