Sciweavers

560 search results - page 99 / 112
» A Measure of Space for Computing over the Reals
Sort
View
ICPP
2000
IEEE
15 years 2 months ago
A Scalable Parallel Subspace Clustering Algorithm for Massive Data Sets
Clustering is a data mining problem which finds dense regions in a sparse multi-dimensional data set. The attribute values and ranges of these regions characterize the clusters. ...
Harsha S. Nagesh, Sanjay Goil, Alok N. Choudhary
STACS
1999
Springer
15 years 1 months ago
Lower Bounds for Dynamic Algebraic Problems
Abstract. We consider dynamic evaluation of algebraic functions (matrix multiplication, determinant, convolution, Fourier transform, etc.) in the model of Reif and Tate; i.e., if f...
Gudmund Skovbjerg Frandsen, Johan P. Hansen, Peter...
79
Voted
ECCV
2006
Springer
15 years 1 months ago
A Batch Algorithm for Implicit Non-rigid Shape and Motion Recovery
The recovery of 3D shape and camera motion for non-rigid scenes from single-camera video footage is a very important problem in computer vision. The low-rank shape model consists ...
Adrien Bartoli, Søren I. Olsen
GECCO
2008
Springer
143views Optimization» more  GECCO 2008»
14 years 10 months ago
Application domain study of evolutionary algorithms in optimization problems
This paper deals with the problem of comparing and testing evolutionary algorithms, that is, the benchmarking problem, from an analysis point of view. A practical study of the app...
Pilar Caamaño, Francisco Bellas, José...
WWW
2006
ACM
15 years 10 months ago
Geographically focused collaborative crawling
A collaborative crawler is a group of crawling nodes, in which each crawling node is responsible for a specific portion of the web. We study the problem of collecting geographical...
Weizheng Gao, Hyun Chul Lee, Yingbo Miao