Sciweavers

6142 search results - page 121 / 1229
» The Complexity of Partition Functions
Sort
View
SIGGRAPH
1996
ACM
15 years 2 months ago
Hierarchical Image Caching for Accelerated Walkthroughs of Complex Environments
We present a new method that utilizes path coherence to accelerate walkthroughs of geometrically complex static scenes. As a preprocessing step, our method constructs a BSP-tree t...
Jonathan Shade, Dani Lischinski, David Salesin, To...
SAC
2011
ACM
14 years 24 days ago
Tracking continuous topological changes of complex moving regions
A moving region whose location and extend change over time can imply topological changes such as region split and hole formation. To study this phenomenon is useful in many applic...
Hechen Liu, Markus Schneider
JELIA
2004
Springer
15 years 3 months ago
Representation and Complexity in Boolean Games
Boolean games are a class of two-player games which may be defined via a Boolean form over a set of atomic actions. A particular game on some form is instantiated by partitioning ...
Paul E. Dunne, Wiebe van der Hoek
SODA
2000
ACM
132views Algorithms» more  SODA 2000»
14 years 11 months ago
Expected-case complexity of approximate nearest neighbor searching
Most research in algorithms for geometric query problems has focused on their worstcase performance. However, when information on the query distribution is available, the alternat...
Sunil Arya, Ho-Yam Addy Fu
ALT
2003
Springer
15 years 7 months ago
Intrinsic Complexity of Uniform Learning
Inductive inference is concerned with algorithmic learning of recursive functions. In the model of learning in the limit a learner successful for a class of recursive functions mus...
Sandra Zilles