Sciweavers

2214 search results - page 59 / 443
» complexity 2004
Sort
View
KR
2004
Springer
14 years 1 months ago
Learning Probabilistic Relational Planning Rules
To learn to behave in highly complex domains, agents must represent and learn compact models of the world dynamics. In this paper, we present an algorithm for learning probabilist...
Hanna Pasula, Luke S. Zettlemoyer, Leslie Pack Kae...
CGI
2004
IEEE
13 years 11 months ago
Interactive Rendering with LOD Control and Occlusion Culling Based on Polygon Hierarchies
This paper presents a new method of combining dynamic control of LOD and conservative occlusion culling based on a new hierarchical data structure of polygons. Our method is effec...
Tokuo Tsuji, Hongbin Zha, Ryo Kurazume, Tsutomu Ha...
IFIP
2004
Springer
14 years 1 months ago
Asymptotic Behaviors of Type-2 Algorithms and Induced Baire Topologies
Abstract We propose an alternative notion of asymptotic behaviors for the study of type2 computational complexity. Since the classical asymptotic notion (for all but finitely many...
Chung-Chih Li
PERCOM
2004
ACM
14 years 7 months ago
Mix Zones: User Privacy in Location-aware Services
Privacy of personal location information is becoming an increasingly important issue. This paper refines a method, called the mix zone, developed to enhance user privacy in locati...
Alastair R. Beresford, Frank Stajano
APPROX
2004
Springer
116views Algorithms» more  APPROX 2004»
14 years 1 months ago
Randomized Approximation Algorithms for Set Multicover Problems with Applications to Reverse Engineering of Protein and Gene Net
In this paper we investigate the computational complexity of a combinatorial problem that arises in the reverse engineering of protein and gene networks. Our contributions are as ...
Piotr Berman, Bhaskar DasGupta, Eduardo D. Sontag