Sciweavers

1007 search results - page 151 / 202
» Worst-Case Optimal Algorithms for Parallel Query Processing
Sort
View
189
Voted
SIGMOD
2009
ACM
137views Database» more  SIGMOD 2009»
16 years 2 months ago
Robust and efficient algorithms for rank join evaluation
In the rank join problem we are given a relational join R1 1 R2 and a function that assigns numeric scores to the join tuples, and the goal is to return the tuples with the highes...
Jonathan Finger, Neoklis Polyzotis
116
Voted
IDEAS
2000
IEEE
90views Database» more  IDEAS 2000»
15 years 6 months ago
StreamJoin: A Generic Database Approach to Support the Class of Stream-Oriented Applications
Today many applications routinely generate large quantities of data. The data often takes the form of (time) series, or more generally streams, i.e. an ordered sequence of records...
Clara Nippl, Ralf Rantzau, Bernhard Mitschang
154
Voted
ISPAN
2009
IEEE
15 years 9 months ago
High Speed Articulated Object Tracking Using GPUs: A Particle Filter Approach
—This paper presents a novel application of the GPU processing power to a very computationally demanding articulated human body tracking problem in a view-based approach. This wo...
Raúl Cabido, David Concha, Juan José...
ICASSP
2010
IEEE
15 years 2 months ago
Simultaneous search for all modes in multilinear models
Parallel factor (PARAFAC) analysis is an extension of a low rank decomposition to higher way arrays, usually called tensors. Most of existing methods are based on an alternating l...
Petr Tichavský, Zbynek Koldovský
ICASSP
2011
IEEE
14 years 5 months ago
Low-complexity predictive lossy compression of hyperspectral and ultraspectral images
Lossy compression of hyperspectral and ultraspectral images is traditionally performed using 3D transform coding. This approach yields good performance, but its complexity and mem...
Andrea Abrardo, Mauro Barni, Enrico Magli