17129 search results - page 362 / 3426 » Applied Computing |
187
click to vote
COMGEO
2000
ACM
15 years 6 months ago
2000
ACM
Given a set X of points in the plane, two distinguished points s,t X, and a set of obstacles represented by line segments, we wish to compute a simple polygonal path from s to t...
143
Voted
CIE
2010
Springer
15 years 5 months ago
2010
Springer
We investigate the computability of countable subshifts in one dimension, and their members. Subshifts of Cantor-Bendixson rank one contain only eventually periodic elements. Any ...
195
click to vote
ACII
2011
Springer
14 years 6 months ago
2011
Springer
Current approaches to story generation do not utilize models of human affect to create stories with dramatic arc, suspense, and surprise. This paper describes current and future wo...
211
click to vote
CF
2007
ACM
15 years 8 months ago
2007
ACM
In recent years, highly accurate branch predictors have been proposed primarily for high performance processors. Unfortunately such predictors are extremely energy consuming and i...
159
click to vote
ISVC
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Linear systems and eigen-calculations on symmetric diagonally dominant matrices (SDDs) occur ubiquitously in computer vision, computer graphics, and machine learning. In ...