40 search results - page 7 / 8 » Exact Algorithms for a Geometric Packing Problem (Extended A... |
COMPGEOM
2008
ACM
13 years 8 months ago
2008
ACM
We consider the problem of finding a maximum number of disjoint paths for unit disks moving amidst static or dynamic obstacles. For the static case we give efficient exact algorit...
STOC
2009
ACM
14 years 6 months ago
2009
ACM
d Abstract] Virginia Vassilevska School of Mathematics Institute for Advanced Study Princeton, NJ 08540 USA virgi@math.ias.edu Ryan Williams School of Mathematics Institute for Adv...
AMAI
2005
Springer
13 years 6 months ago
2005
Springer
Abstract. This paper is concerned with the reliable inference of optimal treeapproximations to the dependency structure of an unknown distribution generating data. The traditional ...
EDBTW
2006
Springer
13 years 9 months ago
2006
Springer
Abstract. Inconsistent contexts are death-wounds which usually result in contextaware applications' incongruous behaviors and users' perplexed feelings, therefore the ben...
ALT
2003
Springer
13 years 9 months ago
2003
Springer
Abstract. Inductive inference can be considered as one of the fundamental paradigms of algorithmic learning theory. We survey results recently obtained and show their impact to pot...