4212 search results - page 172 / 843 » On Compressible Pairings and Their Computation |
261
click to vote
CAD
2011
Springer
15 years 1 months ago
2011
Springer
The problem of computing the minimum enclosing sphere (MES) of a point set is a classical problem in Computational Geometry. As an LP-type problem, its expected running time on th...
173
click to vote
IJFCS
2006
15 years 6 months ago
2006
Abstract. Local similarity computation between two sequences permits detecting all the relevant alignments present between subsequences thereof. A well-known dynamic programming al...
181
click to vote
WCC
2005
Springer
16 years 9 hour ago
2005
Springer
In this paper, we describe a broad class of problems arising in the context of designing codes for DNA computing. We primarily focus on design considerations pertaining to the phen...
189
click to vote
GRAPHICSINTERFACE
1996
15 years 7 months ago
1996
Many educators have used Algorithm Visualization (AV) to teach students of computer science about how computer algorithms work. Our study sheds light on two important questions: (...
168
click to vote
SAC
2008
ACM
15 years 6 months ago
2008
ACM
Skyline queries are important due to their usefulness in many application domains. However, by increasing the number of attributes, the probability that a tuple dominates another ...