Sciweavers

1227 search results - page 111 / 246
» Approximate Kernel Clustering
Sort
View
EWSN
2004
Springer
15 years 9 months ago
Design of Surveillance Sensor Grids with a Lifetime Constraint
A surveillance area is to be monitored using a grid network of heterogeneous sensor nodes. There are two types of nodes; type 0 nodes which perform sensing and relaying of data wit...
Vivek Mhatre, Catherine Rosenberg, Daniel Kofman, ...
COMPGEOM
2001
ACM
15 years 1 months ago
Discrete mobile centers
We propose a new randomized algorithm for maintaining a set of clusters among moving nodes in the plane. Given a specified cluster radius, our algorithm selects and maintains a va...
Jie Gao, Leonidas J. Guibas, John Hershberger, Li ...
PAMI
2010
164views more  PAMI 2010»
14 years 8 months ago
Large-Scale Discovery of Spatially Related Images
— We propose a randomized data mining method that finds clusters of spatially overlapping images. The core of the method relies on the min-Hash algorithm for fast detection of p...
Ondrej Chum, Jiri Matas
FOCS
2005
IEEE
15 years 3 months ago
On Non-Approximability for Quadratic Programs
This paper studies the computational complexity of the following type of quadratic programs: given an arbitrary matrix whose diagonal elements are zero, find x ∈ {−1, +1}n th...
Sanjeev Arora, Eli Berger, Elad Hazan, Guy Kindler...
ACSAC
2001
IEEE
15 years 1 months ago
Mining Alarm Clusters to Improve Alarm Handling Efficiency
It is a well-known problem that intrusion detection systems overload their human operators by triggering thousands of alarms per day. As a matter of fact, we have been asked by on...
Klaus Julisch