Sciweavers

451 search results - page 74 / 91
» Some Lower Bounds on Geometric Separability Problems
Sort
View
WIOPT
2010
IEEE
14 years 7 months ago
Stable throughput, rate control, and delay in multi-access channels
In this paper, we investigate the stability and delay issues of a two-user multi-access channel at the bit level. The two users, have the option to transmit at a higher rate (measu...
Beiyu Rong, Anthony Ephremides
WACV
2007
IEEE
15 years 3 months ago
Warped Document Image Restoration Using Shape-from-Shading and Physically-Based Modeling
With the pervasive use of handheld digital devices such as camera phones and PDAs, people have started to capture images as a way of recording information. However, due to the non...
Li Zhang, Chew Lim Tan
JMLR
2008
168views more  JMLR 2008»
14 years 9 months ago
Max-margin Classification of Data with Absent Features
We consider the problem of learning classifiers in structured domains, where some objects have a subset of features that are inherently absent due to complex relationships between...
Gal Chechik, Geremy Heitz, Gal Elidan, Pieter Abbe...
NIPS
2001
14 years 11 months ago
K-Local Hyperplane and Convex Distance Nearest Neighbor Algorithms
Guided by an initial idea of building a complex (non linear) decision surface with maximal local margin in input space, we give a possible geometrical intuition as to why K-Neares...
Pascal Vincent, Yoshua Bengio
SIAMJO
2008
108views more  SIAMJO 2008»
14 years 9 months ago
Sparse SOS Relaxations for Minimizing Functions that are Summations of Small Polynomials
This paper discusses how to find the global minimum of functions that are summations of small polynomials ("small" means involving a small number of variables). Some spa...
Jiawang Nie, James Demmel