5214 search results - page 140 / 1043 » The Online Specialization Problem |
159
click to vote
AAIM
2009
Springer
15 years 1 months ago
2009
Springer
In this paper we introduce a discrete version of the online traveling salesman problem (DOLTSP). We represent the metric space using a weighted graph, where the server is allowed t...
218
Voted
CHI
2011
ACM
14 years 7 months ago
2011
ACM
Although science is becoming increasingly collaborative, there are remarkably few success stories of online collaborations between professional scientists that actually result in ...
133
Voted
ICALP
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. This paper tackles three algorithmic problems for probabilistic automata on finite words: the Emptiness Problem, the Isolation Problem and the Value 1 Problem. The Empti...
147
click to vote
ECCV
2008
Springer
16 years 5 months ago
2008
Springer
Visual tracking is a challenging problem, as an object may change its appearance due to viewpoint variations, illumination changes, and occlusion. Also, an object may leave the fie...
133
Voted
STACS
2010
Springer
15 years 11 months ago
2010
Springer
We study the online clustering problem where data items arrive in an online fashion. The algorithm maintains a clustering of data items into similarity classes. Upon arrival of v, ...