2583 search results - page 8 / 517 » On the Representation of Timed Polyhedra |
VG
2003
13 years 9 months ago
2003
Finite element methods commonly use unstructured grids as the computational domain. As a matter of fact, the volume visualization of these unstructured grids is a time consuming t...
JMLR
2006
13 years 7 months ago
2006
We discuss the problem of learning to rank labels from a real valued feedback associated with each label. We cast the feedback as a preferences graph where the nodes of the graph ...
ANOR
2005
13 years 7 months ago
2005
Abstract. This is an overview of the significance and main uses of projection, lifting and extended formulation in integer and combinatorial optimization. Its first two sections de...
COMPGEOM
2003
ACM
14 years 1 months ago
2003
ACM
We introduce a new realistic input model for geometric graphs and nonconvex polyhedra. A geometric graph G is local if (1) the longest edge at every vertex v is only a constant fa...
ICRA
2006
IEEE
14 years 1 months ago
2006
IEEE
— This paper presents a comparative analysis relative to the experimental performances of an asymptotically fast and incremental algorithm, recently developed to compute collisio...