Sciweavers

477 search results - page 73 / 96
» Algorithms for dynamic geometric problems over data streams
Sort
View
ICCV
2007
IEEE
14 years 2 months ago
Fast Matching of Planar Shapes in Sub-cubic Runtime
The matching of planar shapes can be cast as a problem of finding the shortest path through a graph spanned by the two shapes, where the nodes of the graph encode the local simil...
Frank R. Schmidt, Dirk Farin, Daniel Cremers
ASPDAC
2011
ACM
227views Hardware» more  ASPDAC 2011»
13 years 2 days ago
Minimizing buffer requirements for throughput constrained parallel execution of synchronous dataflow graph
– This paper concerns throughput-constrained parallel execution of synchronous data flow graphs. This paper assumes static mapping and dynamic scheduling of nodes, which has seve...
Tae-ho Shin, Hyunok Oh, Soonhoi Ha
CGF
2006
148views more  CGF 2006»
13 years 8 months ago
Analysis of Reproducing Real-World Appearance on Displays of Varying Dynamic Range
We conduct a series of experiments to investigate the desired properties of a tone mapping operator (TMO) and to design such an operator based on subjective data. We propose a nov...
Akiko Yoshida, Rafal Mantiuk, Karol Myszkowski, Ha...
FGR
2008
IEEE
255views Biometrics» more  FGR 2008»
14 years 2 months ago
Aligned Cluster Analysis for temporal segmentation of human motion
Temporal segmentation of human motion into actions is a crucial step for understanding and building computational models of human motion. Several issues contribute to the challeng...
Feng Zhou, Fernando De la Torre, Jessica K. Hodgin...
SDM
2010
SIAM
202views Data Mining» more  SDM 2010»
13 years 6 months ago
Multiresolution Motif Discovery in Time Series
Time series motif discovery is an important problem with applications in a variety of areas that range from telecommunications to medicine. Several algorithms have been proposed t...
Nuno Castro, Paulo J. Azevedo