2583 search results - page 278 / 517 » On the Representation of Timed Polyhedra |
202
click to vote
KCAP
2003
ACM
16 years 21 days ago
2003
ACM
Because it is difficult to engineer a complex ontology with time, we here consider a method that allows for factorizing the complexity of the engineering process, FONTE (Factoriz...
208
click to vote
ICCS
2003
Springer
16 years 19 days ago
2003
Springer
Research on semantic search has become heated these years. In this paper we propose an approach focusing on searching for resources with descriptions. The knowledge representation ...
211
click to vote
ICVS
2003
Springer
16 years 19 days ago
2003
Springer
This paper presents a new scenario recognition algorithm for Video Interpretation. We represent a scenario model with the characters involved in the scenario, with its sub-scenario...
180
Voted
COMPGEOM
2010
ACM
16 years 15 days ago
2010
ACM
Let B be a collection of n arbitrary balls in R3 . We establish an almost-tight upper bound of O(n3+ε ), for any ε > 0, on the complexity of the space F(B) of all the lines t...
187
click to vote
ICRA
2002
IEEE
16 years 11 days ago
2002
IEEE
As a general framework to determine a collision-free feedback motion strategies, the Random Neighborhood Graph (RNG) approach [19] defines a global navigation function over an ap...