Sciweavers

1132 search results - page 186 / 227
» Upper and lower Ramsey bounds in bounded arithmetic
Sort
View
ICML
2007
IEEE
16 years 2 months ago
Asymptotic Bayesian generalization error when training and test distributions are different
In supervised learning, we commonly assume that training and test data are sampled from the same distribution. However, this assumption can be violated in practice and then standa...
Keisuke Yamazaki, Klaus-Robert Müller, Masash...
STOC
2004
ACM
129views Algorithms» more  STOC 2004»
16 years 2 months ago
Sorting and searching in the presence of memory faults (without redundancy)
We investigate the design of algorithms resilient to memory faults, i.e., algorithms that, despite the corruption of some memory values during their execution, are able to produce...
Irene Finocchi, Giuseppe F. Italiano
DCC
2006
IEEE
16 years 1 months ago
Analysis of Multiple Antenna Systems with Finite-Rate Feedback Using High Resolution Quantization Theory
This paper considers the development of a general framework for the analysis of transmit beamforming methods in multiple antenna systems with finite-rate feedback. Inspired by the...
Jun Zheng, Ethan R. Duni, Bhaskar D. Rao
ICS
2010
Tsinghua U.
15 years 11 months ago
Local Algorithms for Finding Interesting Individuals in Large Networks
: We initiate the study of local, sublinear time algorithms for finding vertices with extreme topological properties -- such as high degree or clustering coefficient -- in large so...
Mickey Brautbar, Michael Kearns
STACS
2009
Springer
15 years 8 months ago
Error-Correcting Data Structures
We study data structures in the presence of adversarial noise. We want to encode a given object in a succinct data structure that enables us to efficiently answer specific queries...
Ronald de Wolf