Sciweavers

2262 search results - page 165 / 453
» Points with large quadrant-depth
Sort
View
APDC
1997
15 years 7 months ago
An Improved Parallel Algorithm for Delaunay Triangulation on Distributed Memory Parallel Computers
Delaunaytriangulationhas beenmuchusedin suchapplicationsas volumerendering, shape representation, terrain modeling and so on. The main disadvantage of Delaunay triangulationis lar...
Sangyoon Lee, Chan-Ik Park, Chan-Mo Park
ISMB
1996
15 years 7 months ago
Compact Encoding Strategies for DNA Sequence Similarity Search
Determining whether two DNA sequences are similar is an essential component of DNA sequence analysis. Dynamic programming is the algorithm of choice if computational time is not t...
David J. States, Pankaj Agarwal
PPSC
1993
15 years 7 months ago
I/O for TFLOPS Supercomputers
Scalable parallel computers with TFLOPS (Trillion FLoating Point Operations Per Second) performance levels are now under construction. While we believe TFLOPS processor technology...
Erik DeBenedictis, Stephen C. Johnson
ATAL
2010
Springer
15 years 7 months ago
Point-based backup for decentralized POMDPs: complexity and new algorithms
Decentralized POMDPs provide an expressive framework for sequential multi-agent decision making. Despite their high complexity, there has been significant progress in scaling up e...
Akshat Kumar, Shlomo Zilberstein
MM
2010
ACM
199views Multimedia» more  MM 2010»
15 years 6 months ago
TOP-SURF: a visual words toolkit
TOP-SURF is an image descriptor that combines interest points with visual words, resulting in a high performance yet compact descriptor that is designed with a wide range of conte...
Bart Thomee, Erwin M. Bakker, Michael S. Lew