Sciweavers

1092 search results - page 123 / 219
» Polynomial Interpretations and the Complexity of Algorithms
Sort
View
NIPS
2007
15 years 7 months ago
What makes some POMDP problems easy to approximate?
Point-based algorithms have been surprisingly successful in computing approximately optimal solutions for partially observable Markov decision processes (POMDPs) in high dimension...
David Hsu, Wee Sun Lee, Nan Rong
EDBT
2011
ACM
231views Database» more  EDBT 2011»
14 years 9 months ago
Data integration with dependent sources
Data integration systems offer users a uniform interface to a set of data sources. Previous work has typically assumed that the data sources are independent of each other; however...
Anish Das Sarma, Xin Luna Dong, Alon Y. Halevy
COLT
2008
Springer
15 years 8 months ago
Learning Rotations
An algorithm is presented for online learning of rotations. The proposed algorithm involves matrix exponentiated gradient updates and is motivated by the von Neumann divergence. T...
Adam M. Smith, Manfred K. Warmuth
KDD
2006
ACM
115views Data Mining» more  KDD 2006»
16 years 6 months ago
Aggregating time partitions
Partitions of sequential data exist either per se or as a result of sequence segmentation algorithms. It is often the case that the same timeline is partitioned in many different ...
Evimaria Terzi, Panayiotis Tsaparas, Taneli Mielik...
VTC
2006
IEEE
138views Communications» more  VTC 2006»
16 years 4 days ago
Transmit Precoding for the Multiple Antenna Broadcast Channel
— In this paper we compare the following two methods of transmit precoding for the multiple antenna broadcast channel: vector perturbation applied to channel inversion (also term...
Manish Airy, Sandeep Bhadra, Robert W. Heath Jr., ...