15033 search results - page 2725 / 3007 » Complexity Theory and Algorithms |
164
click to vote
FOCS
1999
IEEE
15 years 10 months ago
1999
IEEE
We consider the DIRECTED STEINER NETWORK problem, also called the POINT-TO-POINT CONNECTION problem, where given a directed graph G and p pairs {(s1,t1),...,(sp,tp)} of nodes in t...
240
click to vote
SIGGRAPH
1999
ACM
15 years 10 months ago
1999
ACM
In this paper, a new technique for modeling textured 3D faces is introduced. 3D faces can either be generated automatically from one or more photographs, or modeled directly throu...
165
click to vote
SIGMOD
1999
ACM
15 years 10 months ago
1999
ACM
In large data warehousing environments, it is often advantageous to provide fast, approximate answers to complex aggregate queries based on statistical summaries of the full data....
176
click to vote
ICMCS
1999
IEEE
15 years 10 months ago
1999
IEEE
In this paper, we propose an original indexing by shape of image databases based on extended grid files. We first introduce a recently developed shape description method and tailo...
150
click to vote
ICRA
1999
IEEE
15 years 10 months ago
1999
IEEE
Three fundamental problems in the study of grasping and dextrous manipulation with multifingered robotic hands are as follows. a) Given a robotic hand and a grasp characterized by ...