Sciweavers

10412 search results - page 248 / 2083
» The efficiency of algorithms - misconceptions
Sort
View
164
Voted
CVPR
2010
IEEE
15 years 7 months ago
Ray Markov Random Fields for Image-Based 3D Modeling: Model and Efficient Inference
In this paper, we present an approach to multi-view image-based 3D reconstruction by statistically inversing the ray-tracing based image generation process. The proposed algorithm...
Shubao Liu, David Cooper
CIKM
2006
Springer
15 years 5 months ago
Efficiently clustering transactional data with weighted coverage density
In this paper, we propose a fast, memory-efficient, and scalable clustering algorithm for analyzing transactional data. Our approach has three unique features. First, we use the c...
Hua Yan, Keke Chen, Ling Liu
137
Voted
IMR
1998
Springer
15 years 8 months ago
Mesh Graph Structure for Longest-Edge Refinement Algorithms
In this paper we introduce and discuss a graph structure associated with longest-edge algorithms (algorithms based on the bisection of triangles by the longest-edge) which can be u...
Angel Plaza, José P. Suárez, Miguel ...
154
Voted
FAW
2008
Springer
137views Algorithms» more  FAW 2008»
15 years 5 months ago
Constraint Bipartite Vertex Cover: Simpler Exact Algorithms and Implementations
constraint bipartite vertex cover is a graph-theoretical formalization of the spare allocation problem for reconfigurable arrays. We report on an implementation of a parameterized ...
Guoqiang Bai 0002, Henning Fernau
PAMI
2010
222views more  PAMI 2010»
15 years 2 months ago
Fast Algorithm for Walsh Hadamard Transform on Sliding Windows
— This paper proposes a fast algorithm for Walsh Hadamard Transform on sliding windows which can be used to implement pattern matching most efficiently. The computational require...
Wanli Ouyang, Wai-kuen Cham