4315 search results - page 101 / 863 » Sorting in linear time |
155
Voted
BTW
2003
Springer
15 years 8 months ago
2003
Springer
Abstract: Optimization of nested queries, in particular finding equivalent “flattened” queries for queries that employ the SQL sub-query construct, has been researched extensiv...
116
Voted
EDBTW
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. Algorithms for processing Structural Joins embody essential building blocks for XML query evaluation. Their design is a difficult task, because they have to satisfy many ...
126
Voted
FORMATS
2006
Springer
15 years 6 months ago
2006
Springer
Timed and weak timed simulation relations are often used to show that operations on hybrid systems result in equivalent behavior or in conservative overapproximations. Given that s...
ICPR
2008
IEEE
15 years 9 months ago
2008
IEEE
The locally linear embedding (LLE) algorithm is considered as a powerful method for the problem of nonlinear dimensionality reduction. In this paper, first, a new method called cl...
114
click to vote
JACM
2010
15 years 1 months ago
2010
We present a linear expected time algorithm for finding maximum cardinality matchings in sparse random graphs. This is optimal and improves on previous results by a logarithmic f...