Sciweavers

3690 search results - page 691 / 738
» Computation with classical sequents
Sort
View
STOC
2010
ACM
168views Algorithms» more  STOC 2010»
14 years 7 months ago
Non-commutative circuits and the sum-of-squares problem
We initiate a direction for proving lower bounds on the size of non-commutative arithmetic circuits. This direction is based on a connection between lower bounds on the size of no...
Pavel Hrubes, Avi Wigderson and Amir Yehudayoff
COCO
2003
Springer
118views Algorithms» more  COCO 2003»
14 years 3 months ago
Lower bounds for predecessor searching in the cell probe model
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
Pranab Sen

Book
778views
15 years 8 months ago
Gaussian Processes for Machine Learning
"Gaussian processes (GPs) provide a principled, practical, probabilistic approach to learning in kernel machines. GPs have received increased attention in the machine-learning...
Carl Edward Rasmussen and Christopher K. I. Willia...

Publication
118views
15 years 6 days ago
The Minimum Circuity Frontier and the Journey to Work
People travel between places of residence and work destinations via transportation net- works. The relation between selection of home and work locations has been heavily debated ...
Levinson, D. and El-Geneidy A.
ICIP
2002
IEEE
14 years 12 months ago
Matching pursuits video coding using generalized bit-planes
The Matching Pursuits (MP) coding method has been employed successfully in video coding. In it, the motion compensated frame difference is decomposed on an overcomplete dictionary...
Alexandre G. Ciancio, Eduardo A. B. da Silva, Rog&...