4212 search results - page 269 / 843 » On Compressible Pairings and Their Computation |
185
click to vote
ICMLA
2007
15 years 8 months ago
2007
— This paper addresses the problem of understanding preservation and reconstruction requirements for computeraided medical decision-making. With an increasing number of computer-...
218
click to vote
ICDE
2012
IEEE
13 years 9 months ago
2012
IEEE
—Shortest distance query between two nodes is a fundamental operation in large-scale networks. Most existing methods in the literature take a landmark embedding approach, which s...
172
click to vote
DNA
2004
Springer
16 years 3 days ago
2004
Springer
The extraction of DNA strands including a given sequence of bases is a crucial step in the Adleman-Lipton extract model of DNA computing. In this paper, a special type of PCR is pr...
166
click to vote
GD
2004
Springer
16 years 3 days ago
2004
Springer
We present an O(n) time algorithm for simultaneous embedding of pairs of planar graphs on the O(n2 )×O(n2 ) grid, with at most three bends per edge, where n is the number of verti...
205
click to vote
DASFAA
2008
IEEE
15 years 8 months ago
2008
IEEE
In this paper, we study novel Tree + IDREF data model for keyword search in XML. In this model, we propose novel Lowest Referred Ancestor (LRA) pair, Extended LRA (ELRA) pair and E...