Sciweavers

1092 search results - page 68 / 219
» Convex Methods for Transduction
Sort
View
AUTOMATICA
2007
72views more  AUTOMATICA 2007»
13 years 10 months ago
A probabilistic analytic center cutting plane method for feasibility of uncertain LMIs
ust control problems can be formulated in abstract form as convex feasibility programs, where one seeks a solution x that satisfies a set of inequalities of the form F . = {f (x,...
Giuseppe C. Calafiore, Fabrizio Dabbene
TIP
2011
124views more  TIP 2011»
13 years 5 months ago
A Geometric Method for Optimal Design of Color Filter Arrays
—A color filter array (CFA) used in a digital camera is a mosaic of spectrally selective filters, which allows only one color component to be sensed at each pixel. The missing ...
Pengwei Hao, Yan Li, Zhouchen Lin, Eric Dubois
JMLR
2010
135views more  JMLR 2010»
13 years 8 months ago
Bundle Methods for Regularized Risk Minimization
A wide variety of machine learning problems can be described as minimizing a regularized risk functional, with different algorithms using different notions of risk and differen...
Choon Hui Teo, S. V. N. Vishwanathan, Alex J. Smol...
GD
2009
Springer
13 years 8 months ago
Algebraic Methods for Counting Euclidean Embeddings of Rigid Graphs
Abstract. The study of (minimally) rigid graphs is motivated by numerous applications, mostly in robotics and bioinformatics. A major open problem concerns the number of embeddings...
Ioannis Z. Emiris, Elias P. Tsigaridas, Antonios V...
PODS
2003
ACM
116views Database» more  PODS 2003»
14 years 10 months ago
On nearest neighbor indexing of nonlinear trajectories
In recent years, the problem of indexing mobile objects has assumed great importance because of its relevance to a wide variety of applications. Most previous results in this area...
Charu C. Aggarwal, Dakshi Agrawal