2600 search results - page 28 / 520 » Clustering with or without the Approximation |
DICTA
2003
14 years 11 months ago
2003
This paper proposes an algorithm to estimate gaze direction without on-site calibration even when the position of the head relative to the camera moves...
108
click to vote
FAW
2010
Springer
14 years 8 months ago
2010
Springer
The newsvendor problem describes the dilemma of a newspaper salesman—how many papers should he purchase each day to resell, when he doesn’t know the demand? We develop approach...
70
Voted
TOSN
2010
14 years 8 months ago
2010
Boundary recognition is an important and challenging issue in wireless sensor networks when no coordinates or distances are available. The distinction between inner and boundary n...
ISPD
2010
ACM
15 years 4 months ago
2010
ACM
This paper presents SafeChoice (SC), a novel clustering algorithm for wirelength-driven placement. Unlike all previous approaches, SC is proposed based on a fundamental theorem, s...
70
Voted
ICPR
2008
IEEE
15 years 11 months ago
2008
IEEE
We present a new L1-distance-based k-means clustering algorithm to address the challenge of clustering high-dimensional proportional vectors. The new algorithm explicitly incorpor...