11565 search results - page 319 / 2313 » Computing Minimal Mappings |
184
click to vote
COMPGEOM
2003
ACM
16 years 1 days ago
2003
ACM
Given a polygonal curve and a geometric graph, we describe an efficient algorithm to find a path in the graph which is most similar to the curve, using the well-known Fr´echet d...
151
click to vote
IPPS
1993
IEEE
15 years 11 months ago
1993
IEEE
We show the universality of the VEDIC network in simulating other well known interconnection networks by generating the parameters of the VEDtC network automatically. Algorithms a...
206
click to vote
SI3D
2009
ACM
16 years 1 months ago
2009
ACM
We introduce a straightforward, robust, and efficient algorithm for rendering high-quality soft shadows in dynamic scenes. Each frame, points in the scene visible from the eye ar...
232
click to vote
EWSN
2009
Springer
16 years 1 months ago
2009
Springer
In this paper we present SCOPES, a distributed Smart Camera Object Position Estimation sensor network System that provides maps of distribution of people in indoors environments. ...
344
click to vote
EH
1999
IEEE
1999
IEEE
Evolvable Hardware or Learning Hardware? Induction of State Machines from Temporal Logic Constraints
15 years 11 months ago
Here we advocate an approach to learning hardware based on induction of finite state machines from temporal logic constraints. The method involves training on examples, constraint...