Sciweavers

4315 search results - page 114 / 863
» Sorting in linear time
Sort
View
MM
2003
ACM
113views Multimedia» more  MM 2003»
16 years 17 days ago
The combination limit in multimedia retrieval
Combining search results from multimedia sources is crucial for dealing with heterogeneous multimedia data, particularly in multimedia retrieval where a final ranked list of item...
Rong Yan, Alexander G. Hauptmann
SIGARCH
2008
94views more  SIGARCH 2008»
15 years 7 months ago
Optimized on-chip pipelining of memory-intensive computations on the cell BE
Multiprocessors-on-chip, such as the Cell BE processor, regularly suffer from restricted bandwidth to off-chip main memory. We propose to reduce memory bandwidth requirements, and...
Christoph W. Kessler, Jörg Keller
TCSV
2002
67views more  TCSV 2002»
15 years 7 months ago
A new compression scheme for color-quantized images
An efficient compression scheme for color-quantized images based on progressive coding of color information has been developed. Instead of sorting color indexes into a linear list ...
Xin Chen, Sam Kwong, Ju-fu Feng
TVCG
2010
141views more  TVCG 2010»
15 years 5 months ago
Fast Construction of k-Nearest Neighbor Graphs for Point Clouds
—We present a parallel algorithm for k-nearest neighbor graph construction that uses Morton ordering. Experiments show that our approach has the following advantages over existin...
Michael Connor, Piyush Kumar
TIME
2002
IEEE
16 years 6 days ago
A Logical Approach to Represent and Reason about Calendars
In this paper, we propose a logical approach to represent and reason about different time granularities. We identify a time granularity as a discrete infinite sequence of time po...
Carlo Combi, Massimo Franceschet, Adriano Peron