2588 search results - page 275 / 518 » Applications of Kolmogorov complexity to computable model th... |
176
click to vote
CGI
2004
IEEE
15 years 10 months ago
2004
IEEE
This paper describes a new method for generating surfaces of branching tubular structures with given centerlines and radii. As the centerlines are not straight lines, the cross-se...
144
click to vote
SIGOPSE
2004
ACM
16 years 3 days ago
2004
ACM
Computer systems are complex and unforgiving. Users need environments more tolerant of errors, allowing them to correct mistakes and explore alternatives. This is the aim of Joyce...
159
click to vote
ICAI
2003
15 years 8 months ago
2003
Boolean satisfiability (SAT) is the canonical NP-complete problem that plays an important role in AI and has many practical applications in Computer Science in general. Boolean n...
222
click to vote
ICCV
2009
IEEE
15 years 4 months ago
2009
IEEE
Human pose estimation is the task of determining the states (location, orientation and scale) of each body part. It is important for many vision understanding applications, e.g. v...
175
click to vote
SODA
2010
ACM
16 years 4 months ago
2010
ACM
We study the computational complexity of some central analysis problems for One-Counter Markov Decision Processes (OC-MDPs), a class of finitely-presented, countable-state MDPs. O...