Sciweavers

52 search results - page 2 / 11
» HDoV-tree: The Structure, The Storage, The Speed
Sort
View
MICCAI
2006
Springer
14 years 6 months ago
Accurate Banded Graph Cut Segmentation of Thin Structures Using Laplacian Pyramids
The Graph Cuts method of interactive segmentation has become very popular in recent years. This method performs at interactive speeds for smaller images/volumes, but an unacceptabl...
Ali Kemal Sinop, Leo Grady
CASC
2007
Springer
112views Mathematics» more  CASC 2007»
13 years 11 months ago
Polynomial Division Using Dynamic Arrays, Heaps, and Packed Exponent Vectors
A common way of implementing multivariate polynomial multiplication and division is to represent polynomials as linked lists of terms sorted in a term ordering and to use repeated ...
Michael B. Monagan, Roman Pearce
ISMIR
2005
Springer
129views Music» more  ISMIR 2005»
13 years 11 months ago
Scalable Metadata and Quick Retrieval of Audio Signals
Audio search algorithms have reached a degree of speed and accuracy that allows them to search efficiently within large databases of audio. For speed, algorithms generally depend...
Nancy Bertin, Alain de Cheveigné
JIIS
2002
99views more  JIIS 2002»
13 years 5 months ago
Efficient Management of Persistent Knowledge
Although computer speed has steadily increased and memory is getting cheaper, the need for storage managers to deal efficiently with applications that cannot be held into main memo...
Dimitris G. Kapopoulos, Michael Hatzopoulos, Panag...
ASPLOS
2011
ACM
12 years 9 months ago
NV-Heaps: making persistent objects fast and safe with next-generation, non-volatile memories
nt, user-defined objects present an attractive abstraction for working with non-volatile program state. However, the slow speed of persistent storage (i.e., disk) has restricted ...
Joel Coburn, Adrian M. Caulfield, Ameen Akel, Laur...