Sciweavers

2600 search results - page 198 / 520
» Clustering with or without the Approximation
Sort
View
PODS
2003
ACM
143views Database» more  PODS 2003»
16 years 6 months ago
Maintaining variance and k-medians over data stream windows
The sliding window model is useful for discounting stale data in data stream applications. In this model, data elements arrive continually and only the most recent N elements are ...
Brian Babcock, Mayur Datar, Rajeev Motwani, Liadan...
SODA
1998
ACM
106views Algorithms» more  SODA 1998»
15 years 8 months ago
Greedy Strikes Back: Improved Facility Location Algorithms
A fundamental facility location problem is to choose the location of facilities, such as industrial plants and warehouses, to minimize the cost of satisfying the demand for some c...
Sudipto Guha, Samir Khuller
CORR
2010
Springer
162views Education» more  CORR 2010»
15 years 5 months ago
Networked Computing in Wireless Sensor Networks for Structural Health Monitoring
Abstract—This paper studies the problem of distributed computation over a network of wireless sensors. While this problem applies to many emerging applications, to keep our discu...
Apoorva Jindal, Mingyan Liu
AUSDM
2007
Springer
107views Data Mining» more  AUSDM 2007»
16 years 22 days ago
A Discriminant Analysis for Undersampled Data
One of the inherent problems in pattern recognition is the undersampled data problem, also known as the curse of dimensionality reduction. In this paper a new algorithm called pai...
Matthew Robards, Junbin Gao, Philip Charlton
CRV
2005
IEEE
205views Robotics» more  CRV 2005»
16 years 5 days ago
Head Pose Estimation of Partially Occluded Faces
This paper describes an algorithm which calculates the approximate head pose of partially occluded faces without training or manual initialization. The presented approach works on...
Markus T. Wenzel, Wolfram Schiffmann