5169 search results - page 829 / 1034 » Locality approximation using time |
128
click to vote
COMPUTER
1999
15 years 4 months ago
1999
abstract mathematical or physical statement, not something specific. The way scientific programmers most frequently verify that their programs are correct is to examine their resul...
162
click to vote
CIKM
2010
Springer
15 years 3 months ago
2010
Springer
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
154
click to vote
SSDBM
2010
IEEE
15 years 2 months ago
2010
IEEE
Graphs are prevailingly used in many applications to model complex data structures. In this paper, we study the problem of supergraph containment search. To avoid the NP-complete s...
164
click to vote
RECOMB
2006
Springer
16 years 4 months ago
2006
Springer
This paper proposes a parameterized algorithm for aligning two protein structures, in the case where one protein structure is represented by a contact map graph and the other by a ...
157
click to vote
EUROPAR
2005
Springer
15 years 10 months ago
2005
Springer
The model of moldable task (MT) was introduced some years ago and has been proved to be an efficient way for implementing parallel applications. It considers a target application ...