Sciweavers

6202 search results - page 39 / 1241
» Without Loss of Generality
Sort
View
NECO
2011
14 years 4 months ago
Least Squares Estimation Without Priors or Supervision
Selection of an optimal estimator typically relies on either supervised training samples (pairs of measurements and their associated true values), or a prior probability model for...
Martin Raphan, Eero P. Simoncelli
NIPS
2008
14 years 11 months ago
On the Generalization Ability of Online Strongly Convex Programming Algorithms
This paper examines the generalization properties of online convex programming algorithms when the loss function is Lipschitz and strongly convex. Our main result is a sharp bound...
Sham M. Kakade, Ambuj Tewari
ESA
2009
Springer
144views Algorithms» more  ESA 2009»
15 years 4 months ago
Narrow-Shallow-Low-Light Trees with and without Steiner Points
We show that for every set S of n points in the plane and a designated point rt ∈ S, there exists a tree T that has small maximum degree, depth and weight. Moreover, for every po...
Michael Elkin, Shay Solomon
FORMATS
2006
Springer
15 years 1 months ago
Concurrent Semantics Without the Notions of State or State Transitions
This paper argues that basing the semantics of concurrent systems on the notions of state and state transitions is neither advisable nor necessary. The tendency to do this is deepl...
Edward A. Lee
DAC
2005
ACM
15 years 11 months ago
Exploiting suspected redundancy without proving it
We present several improvements to general-purpose sequential redundancy removal. First, we propose using a robust variety of synergistic transformation and verification algorithm...
Hari Mony, Jason Baumgartner, Viresh Paruthi, Robe...