Sciweavers

202 search results - page 23 / 41
» Algorithmic Information Theory and Foundations of Probabilit...
Sort
View
SWAT
2000
Springer
90views Algorithms» more  SWAT 2000»
14 years 6 days ago
Efficient Expected-Case Algorithms for Planar Point Location
Planar point location is among the most fundamental search problems in computational geometry. Although this problem has been heavily studied from the perspective of worst-case que...
Sunil Arya, Siu-Wing Cheng, David M. Mount, Ramesh...
AAAI
2006
13 years 10 months ago
Value-Function-Based Transfer for Reinforcement Learning Using Structure Mapping
Transfer learning concerns applying knowledge learned in one task (the source) to improve learning another related task (the target). In this paper, we use structure mapping, a ps...
Yaxin Liu, Peter Stone
INFOSCALE
2006
ACM
14 years 2 months ago
A library of constructive skeletons for sequential style of parallel programming
Abstract— With the increasing popularity of parallel programming environments such as PC clusters, more and more sequential programmers, with little knowledge about parallel arch...
Kiminori Matsuzaki, Hideya Iwasaki, Kento Emoto, Z...
CIKM
2008
Springer
13 years 10 months ago
Modeling hidden topics on document manifold
Topic modeling has been a key problem for document analysis. One of the canonical approaches for topic modeling is Probabilistic Latent Semantic Indexing, which maximizes the join...
Deng Cai, Qiaozhu Mei, Jiawei Han, Chengxiang Zhai
TIT
2008
110views more  TIT 2008»
13 years 8 months ago
Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy
We present error-correcting codes that achieve the information-theoretically best possible trade-off between the rate and error-correction radius. Specifically, for every 0 < R...
Venkatesan Guruswami, Atri Rudra