Sciweavers

860 search results - page 76 / 172
» Lower Bounds on the Size of Test Data Sets
Sort
View
AML
2011
204views Mathematics» more  AML 2011»
13 years 2 months ago
A note on propositional proof complexity of some Ramsey-type statements
Any valid Ramsey statement n −→ (k)2 2 can be encoded into a DNF formula RAM(n, k) of size O(nk) and with terms of size k 2 . Let rk be the minimal n for which the statement h...
Jan Krajícek
GLOBECOM
2007
IEEE
13 years 11 months ago
Scaling Laws for Delay Sensitive Traffic in Rayleigh Fading Networks
The throughput of delay sensitive traffic in a Rayleigh fading network is studied by adopting a scaling limit approach. The case of study is that of a pair of nodes establishing a ...
Nikhil Karamchandani, Massimo Franceschetti
COLT
1995
Springer
13 years 11 months ago
Regression NSS: An Alternative to Cross Validation
The Noise Sensitivity Signature (NSS), originally introduced by Grossman and Lapedes (1993), was proposed as an alternative to cross validation for selecting network complexity. I...
Michael P. Perrone, Brian S. Blais
IJCV
2008
155views more  IJCV 2008»
13 years 7 months ago
Fast Transformation-Invariant Component Analysis
For software and more illustrations: http://www.psi.utoronto.ca/anitha/fastTCA.htm Dimensionality reduction techniques such as principal component analysis and factor analysis are...
Anitha Kannan, Nebojsa Jojic, Brendan J. Frey
VLDB
2002
ACM
157views Database» more  VLDB 2002»
14 years 8 months ago
A formal perspective on the view selection problem
The view selection problem is to choose a set of views to materialize over a database schema, such that the cost of evaluating a set of workload queries is minimized and such that ...
Rada Chirkova, Alon Y. Halevy, Dan Suciu