Sciweavers

394 search results - page 71 / 79
» Computing Minimal Polynomials of Matrices
Sort
View
86
Voted
JC
2011
87views more  JC 2011»
14 years 7 months ago
Lower bounds for the complexity of linear functionals in the randomized setting
Abstract. Hinrichs [3] recently studied multivariate integration defined over reproducing kernel Hilbert spaces in the randomized setting and for the normalized error criterion. I...
Erich Novak, Henryk Wozniakowski
143
Voted
FOCS
2004
IEEE
15 years 4 months ago
Tolls for Heterogeneous Selfish Users in Multicommodity Networks and Generalized Congestion Games
We prove the existence of tolls to induce multicommodity, heterogeneous network users that independently choose routes minimizing their own linear function of tolls versus latency...
Lisa Fleischer, Kamal Jain, Mohammad Mahdian
STOC
2010
ACM
269views Algorithms» more  STOC 2010»
15 years 4 months ago
Approximations for the Isoperimetric and Spectral Profile of Graphs and Related Parameters
The spectral profile of a graph is a natural generalization of the classical notion of its Rayleigh quotient. Roughly speaking, given a graph G, for each 0 < < 1, the spect...
Prasad Raghavendra, David Steurer and Prasad Tetal...
119
Voted
CCR
2004
105views more  CCR 2004»
15 years 9 days ago
The measurement manifesto
Useful measurement data is badly needed to help monitor and control large networks. Current approaches to solving measurement problems often assume minimal support from routers and...
George Varghese, Cristian Estan
110
Voted
IJCV
2002
240views more  IJCV 2002»
15 years 6 days ago
Self-Calibration of Rotating and Zooming Cameras
In this paper we describe the theory and practice of self-calibration of cameras which are fixed in location and may freely rotate while changing their internal parameters by zoomi...
Lourdes de Agapito, Eric Hayman, Ian D. Reid