11151 search results - page 255 / 2231 » On the Complexity of Model Expansion |
291
click to vote
TOG
2012
13 years 9 months ago
2012
We present a motion synthesis framework capable of producing a wide variety of important human behaviors that have rarely been studied, including getting up from the ground, crawl...
358
click to vote
STOC
2012
ACM
13 years 9 months ago
2012
ACM
In this paper we develop a new technique for proving lower bounds on the update time and query time of dynamic data structures in the cell probe model. With this technique, we pro...
190
click to vote
COMPGEOM
1996
ACM
15 years 11 months ago
1996
ACM
This paper addresses the complexity of computing the smallest-radius infinite cylinder that encloses an input set of n points in 3-space. We show that the problem can be solved in...
169
click to vote
FORTE
2008
15 years 8 months ago
2008
Designing and interoperability testing of distributed, application-level network protocols is complex. Windows, for example, supports currently more than 200 protocols, ranging fro...
197
click to vote
CIE
2006
Springer
15 years 11 months ago
2006
Springer
Abstract. In this paper, we survey a few recent applications of Kolmogorov complexity to lower bounds in several models of computation. We consider KI complexity of Boolean functio...