14165 search results - page 718 / 2833 » The generalized two-server problem |
196
click to vote
AAAI
2010
15 years 9 months ago
2010
Top-k approximate querying on string collections is an important data analysis tool for many applications, and it has been exhaustively studied. However, the scale of the problem ...
188
click to vote
NIPS
2008
15 years 9 months ago
2008
We introduce a novel framework for estimating vector fields using sparse basis field expansions (S-FLEX). The notion of basis fields, which are an extension of scalar basis functi...
197
Voted
NIPS
2008
15 years 9 months ago
2008
In analogy to the PCA setting, the sparse PCA problem is often solved by iteratively alternating between two subtasks: cardinality-constrained rank-one variance maximization and m...
186
click to vote
NIPS
2008
15 years 9 months ago
2008
The stochastic approximation method is behind the solution to many important, actively-studied problems in machine learning. Despite its farreaching application, there is almost n...
204
click to vote
MVA
2007
15 years 9 months ago
2007
A novel scheme is proposed for achieving motion segmentation in low-frame rate videos, with application to temporal super resolution. Probabilistic generative models are commonly ...