4629 search results - page 853 / 926 » Space Kernel Analysis |
189
click to vote
TC
2010
15 years 1 months ago
2010
In this paper, we define and study a new class of capacity planning models called MAP queueing networks. MAP queueing networks provide the first analytical methodology to describe ...
206
click to vote
COMPGEOM
2011
ACM
14 years 9 months ago
2011
ACM
Given a continuous function f : X → IR on a topological space X, its level set f−1 (a) changes continuously as the real value a changes. Consequently, the connected components...
234
click to vote
SIAMJO
2011
14 years 9 months ago
2011
Suppose we are given a matrix that is formed by adding an unknown sparse matrix to an unknown low-rank matrix. Our goal is to decompose the given matrix into its sparse and low-ran...
191
click to vote
SIGMOD
2012
ACM
13 years 8 months ago
2012
ACM
Query substitution is an important problem in information retrieval. Much work focuses on how to find substitutes for any given query. In this paper, we study how to efficiently ...
201
click to vote
SIGMOD
2012
ACM
13 years 8 months ago
2012
ACM
Locality-Sensitive Hashing (LSH) and its variants are wellknown methods for solving the c-approximate NN Search problem in high-dimensional space. Traditionally, several LSH funct...