16666 search results - page 174 / 3334 » Descriptive and Computational Complexity |
130
click to vote
ISSAC
2009
Springer
15 years 11 months ago
2009
Springer
We describe a new LLL-type algorithm, H-LLL, that relies on Householder transformations to approximate the underlying Gram-Schmidt orthogonalizations. The latter computations are ...
139
click to vote
CORR
2012
Springer
14 years 3 days ago
2012
Springer
Abstract. Let R be a real closed field and D ⊂ R an ordered domain. We give an algorithm that takes as input a polynomial Q ⊂ D[X1, . . . , Xk], and computes a description of ...
131
click to vote
HRI
2006
ACM
15 years 10 months ago
2006
ACM
The paper presents an approach to using structural descriptions, obtained through a human-robot tutoring dialogue, as labels for the visual object models a robot learns. The paper...
147
click to vote
AI
1999
Springer
15 years 4 months ago
1999
Springer
Intelligent systems are often called upon to form plans that direct their own or other agents' activities. For these systems, the ability to describe plans to people in natur...
156
click to vote
WIMOB
2009
IEEE
15 years 11 months ago
2009
IEEE
—Routing in ad hoc networks is a well known issue. Most of the previous propositions to route data between two nodes aimed to define a path (sometimes several ones) on which pac...