160 search results - page 16 / 32 » Sparse decompositions in |
COLT
2005
Springer
15 years 4 months ago
2005
Springer
We present a general decomposition algorithm that is uniformly applicable to every (suitably normalized) instance of Convex Quadratic Optimization and efficiently approaches an o...
103
click to vote
ICDM
2010
IEEE
14 years 8 months ago
2010
IEEE
Thousands of scientific conferences happen every year, and each involves a laborious scientific peer review process conducted by one or more busy scientists serving as Technical/Sc...
103
click to vote
JMLR
2012
13 years 28 days ago
2012
Sparse additive models are families of d-variate functions with the additive decomposition f∗ = ∑j∈S f∗ j , where S is an unknown subset of cardinality s d. In this paper,...
123
click to vote
CIKM
2008
Springer
15 years 14 days ago
2008
Springer
Most prior work on information extraction has focused on extracting information from text in digital documents. However, often, the most important information being reported in an...
86
Voted
COMPGEOM
2006
ACM
15 years 4 months ago
2006
ACM
In a Batched Colored Intersection Searching Problem (CI), one is given a set of n geometric objects (of a certain class). Each object is colored by one of c colors, and the goal i...