4526 search results - page 183 / 906 » Algorithmic problems related to the Internet |
158
Voted
ICPR
2008
IEEE
16 years 5 months ago
2008
IEEE
In this paper we consider the problem of solving different pose and registration problems under rotational constraints. Traditionally, methods such as the iterative closest point ...
160
Voted
TCS
2010
15 years 2 months ago
2010
: We study a variant of the path cover problem, namely, the k-fixed-endpoint path cover problem, or kPC for short. Given a graph G and a subset T of k vertices of V (G), a k-fixe...
155
Voted
CPAIOR
2008
Springer
15 years 6 months ago
2008
Springer
Theoretical models for the evaluation of quickly improving search strategies, like limited discrepancy search, are based on specific assumptions regarding the probability that a va...
280
click to vote
PADL
2009
Springer
16 years 5 months ago
2009
Springer
Abstract. PADS is a declarative language used to describe the syntax and semantic properties of ad hoc data sources such as financial transactions, server logs and scientific data ...
139
Voted
CORR
2010
Springer
14 years 11 months ago
2010
Springer
am analysis and has been widely studied. In this paper we consider this problem at the abstraction level of program schemas in which computations occur in the Herbrand domain of te...