2498 search results - page 31 / 500 » Data Structures with Unpredictable Timing |
117
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Let G = (V, E) be any undirected graph on V vertices and E edges. A path P between any two vertices u, v V is said to be t-approximate shortest path if its length is at most t tim...
150
click to vote
CSB
2005
IEEE
15 years 10 months ago
2005
IEEE
Our paper describes the first provably-efficient algorithm for determining protein structures de novo, solely from experimental data. We show how the global nature of a certain ...
169
click to vote
COCOON
1998
Springer
15 years 8 months ago
1998
Springer
Abstract. In this paper we present the new data structure Colored Sector Search Tree (CSST ) for solving the Nearest-Foreign-Neighbor Query Problem (NFNQP ): Given a set S of n col...
168
click to vote
BMCBI
2006
15 years 4 months ago
2006
Background: An alternative to standard approaches to uncover biologically meaningful structures in micro array data is to treat the data as a blind source separation (BSS) problem...
142
click to vote
SPAA
1990
ACM
15 years 8 months ago
1990
ACM
Fractional cascading is a technique designed to allow e cient sequential search in a graph with catalogs of total size n. The search consists of locating a key in the catalogs alo...