10182 search results - page 1660 / 2037 » Case Studies |
178
click to vote
UC
2005
Springer
16 years 12 days ago
2005
Springer
Abstract. We study computational complexity of counting the fixed point configurations (FPs) in certain classes of graph automata viewed as discrete dynamical systems. We prove t...
168
click to vote
WADS
2005
Springer
16 years 12 days ago
2005
Springer
We study the shortest path problem in weighted polygonal subdivisions of the plane, with the additional constraint of an upper bound, k, on the number of links (segments) in the pa...
199
click to vote
WEBI
2005
Springer
16 years 12 days ago
2005
Springer
Several algorithms based on link analysis have been developed to measure the importance of nodes on a graph such as pages on the World Wide Web. PageRank and HITS are the most pop...
172
click to vote
COMPGEOM
2004
ACM
16 years 11 days ago
2004
ACM
The computation of Delaunay triangulations from static point sets has been extensively studied in computational geometry. When the points move with known trajectories, kinetic dat...
193
click to vote
IUI
2004
ACM
16 years 11 days ago
2004
ACM
This paper describes an attempt to reveal the user’s intention from dialogue acts, thereby improving the effectiveness of natural interfaces to pedagogical agents. It focuses o...