Sciweavers

40 search results - page 2 / 8
» Fast keyword detection with sparse time-frequency models
Sort
View
3DPVT
2006
IEEE
295views Visualization» more  3DPVT 2006»
13 years 6 months ago
Efficient Sparse 3D Reconstruction by Space Sweeping
This paper introduces a feature based method for the fast generation of sparse 3D point clouds from multiple images with known pose. We extract sub-pixel edge elements (2D positio...
Joachim Bauer, Christopher Zach, Horst Bischof
KDD
2008
ACM
165views Data Mining» more  KDD 2008»
14 years 5 months ago
Colibri: fast mining of large static and dynamic graphs
Low-rank approximations of the adjacency matrix of a graph are essential in finding patterns (such as communities) and detecting anomalies. Additionally, it is desirable to track ...
Hanghang Tong, Spiros Papadimitriou, Jimeng Sun, P...
CRYPTO
2000
Springer
124views Cryptology» more  CRYPTO 2000»
13 years 9 months ago
Fast Correlation Attacks through Reconstruction of Linear Polynomials
The task of a fast correlation attack is to efficiently restore the initial content of a linear feedback shift register in a stream cipher using a detected correlation with the out...
Thomas Johansson, Fredrik Jönsson
VC
2008
190views more  VC 2008»
13 years 4 months ago
Fast collision detection using the A-buffer
This paper presents a novel and fast image-space collision detection algorithm with the A-buffer, where the GPU computes the potentially colliding sets (PCSs), and the CPU performs...
Han-Young Jang, JungHyun Han
CVPR
2004
IEEE
14 years 6 months ago
A Fast Multigrid Implicit Algorithm for the Evolution of Geodesic Active Contours
Active contour models are among the most popular PDE-based tools in computer vision. In this paper we present a new algorithm for the fast evolution of geodesic active contours an...
George Papandreou, Petros Maragos