3367 search results - page 138 / 674 » Incremental assignment problem |
103
click to vote
SWAT
2004
Springer
15 years 8 months ago
2004
Springer
Given an edge-distance graph of a set of suppliers and clients, the bottleneck problem is to assign each client to a selected supplier minimizing their maximum distance. We introdu...
128
click to vote
ACISP
2003
Springer
15 years 8 months ago
2003
Springer
Abstract. Privacy presents many puzzles. In particular, why is it eroding, given the high value people assign to their privacy? This extended argues that there are strong incentive...
146
click to vote
ICML
2008
IEEE
16 years 4 months ago
2008
IEEE
In this paper we investigate two aspects of ranking problems on large graphs. First, we augment the deterministic pruning algorithm in Sarkar and Moore (2007) with sampling techni...
125
click to vote
EDBT
2004
ACM
16 years 3 months ago
2004
ACM
We present a novel anytime version of partitional clustering algorithm, such as k-Means and EM, for time series. The algorithm works by leveraging off the multi-resolution property...
128
click to vote
IROS
2009
IEEE
15 years 9 months ago
2009
IEEE
— We aim at developing a singer robot capable of listening to music with its own “ears” and interacting with a human’s musical performance. Such a singer robot requires at ...