Sciweavers

4084 search results - page 599 / 817
» The Method of Quantum Clustering
Sort
View
ICA
2004
Springer
15 years 12 months ago
Soft-LOST: EM on a Mixture of Oriented Lines
Robust clustering of data into overlapping linear subspaces is a common problem. Here we consider one-dimensional subspaces that cross the origin. This problem arises in blind sour...
Paul D. O'Grady, Barak A. Pearlmutter
IPSN
2004
Springer
15 years 12 months ago
Distributed beamforming for information transfer in sensor networks
Energy efficient transfer of data from sensors is a fundamental problem in sensor networks. In this paper, we propose a distributed beamforming approach to this problem, with a cl...
Gwen Barriac, Raghuraman Mudumbai, Upamanyu Madhow
MICAI
2004
Springer
15 years 12 months ago
Faster Proximity Searching in Metric Data
A number of problems in computer science can be solved efficiently with the so called memory based or kernel methods. Among this problems (relevant to the AI community) are multime...
Edgar Chávez, Karina Figueroa
ECCV
2010
Springer
15 years 12 months ago
Building Rome on a Cloudless Day
This paper introduces an approach for dense 3D reconstruction from unregistered Internet-scale photo collections with about 3 million of images within the span of a day on a single...
ATS
2003
IEEE
76views Hardware» more  ATS 2003»
15 years 12 months ago
STAGE: A Decoding Engine Suitable for Multi-Compressed Test Data
: Most of the recently discussed test stimulus data compression techniques are based on the low care bit densities found in typical scan test vectors. Data reduction primarily is a...
Bernd Koenemann