103 search results - page 2 / 21 » On-line Generalized Steiner Problem |
ICB
2007
Springer
13 years 11 months ago
2007
Springer
We present a general biometric hash generation scheme based on vector quantization of multiple feature subsets selected with genetic optimization. The quantization of subsets overc...
NIPS
2001
13 years 6 months ago
2001
The paper studies machine learning problems where each example is described using a set of Boolean features and where hypotheses are represented by linear threshold elements. One ...
ALGORITHMICA
2002
13 years 5 months ago
2002
In this paper we introduce a generalization of Paging to the case where there are many threads of requests. This models situations in which the requests come from more than one ind...
FOCS
1993
IEEE
13 years 9 months ago
1993
IEEE
We consider the following scenario. A point robot is placed at some start location ¡ in a 2dimensional scene containing oriented rectangular obstacles. The robot must repeatedly ...
FSTTCS
2003
Springer
13 years 10 months ago
2003
Springer
The Covering Steiner problem is a common generalization of the k-MST and Group Steiner problems. An instance of the Covering Steiner problem consists of an undirected graph with ed...