Sciweavers

1256 search results - page 150 / 252
» Compositional Memory Systems for Data Intensive Applications
Sort
View
EUROPAR
2009
Springer
14 years 10 months ago
A Parallel Point Matching Algorithm for Landmark Based Image Registration Using Multicore Platform
Abstract. Point matching is crucial for many computer vision applications. Establishing the correspondence between a large number of data points is a computationally intensive proc...
Lin Yang, Leiguang Gong, Hong Zhang, John L. Noshe...
129
Voted
PLDI
2012
ACM
13 years 3 months ago
Speculative separation for privatization and reductions
Automatic parallelization is a promising strategy to improve application performance in the multicore era. However, common programming practices such as the reuse of data structur...
Nick P. Johnson, Hanjun Kim, Prakash Prabhu, Ayal ...
ICDE
2007
IEEE
206views Database» more  ICDE 2007»
16 years 2 months ago
Efficiently Processing Continuous k-NN Queries on Data Streams
Efficiently processing continuous k-nearest neighbor queries on data streams is important in many application domains, e. g. for network intrusion detection or in querysubscriber ...
Beng Chin Ooi, Christian Böhm, Claudia Plant,...
RSP
1999
IEEE
125views Control Systems» more  RSP 1999»
15 years 5 months ago
Extended Synchronous Dataflow for Efficient DSP System Prototyping
Though synchronous dataflow (SDF) graph has been a successful input specification language for digital signal processing (DSP) applications, lack of support for global states makes...
Chanik Park, JaeWoong Chung, Soonhoi Ha
113
Voted
XIMEP
2004
ACM
108views Database» more  XIMEP 2004»
15 years 6 months ago
The Joy of SAX
Most current XQuery implementations require that all XML data reside in memory in one form or another before they start processing the data. This is unacceptable for large XML doc...
Leonidas Fegaras