2969 search results - page 207 / 594 » A space efficient algorithm for group structure computation |
225
Voted
ICDE
2007
IEEE
16 years 5 months ago
2007
IEEE
The All Nearest Neighbor (ANN) operation is a commonly used primitive for analyzing large multi-dimensional datasets. Since computing ANN is very expensive, in previous works R*-t...
121
click to vote
GRID
2005
Springer
15 years 9 months ago
2005
Springer
— In a grid-computing environment, resource selection and scheduling depend on the network topology connecting the computation nodes. This paper presents a method to hierarchical...
131
click to vote
IPPS
2009
IEEE
15 years 10 months ago
2009
IEEE
In this paper we describe the parallelization of a dynamic programming algorithm used to find common RNA secondary structures including pseudoknots and similar structures. The se...
261
Voted
POPL
2008
ACM
16 years 4 months ago
2008
ACM
Self-adjusting computation enables writing programs that can automatically and efficiently respond to changes to their data (e.g., inputs). The idea behind the approach is to stor...
164
click to vote
ECCV
2002
Springer
16 years 5 months ago
2002
Springer
In this paper we address the problem of uncalibrated structure and motion recovery from image sequences that contain dominant planes in some of the views. Traditional approaches fa...