101 search results - page 7 / 21 » Fast approximation of the permanent for very dense problems |
WADS
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. The buy-at-bulk network design problem has been extensively studied in the general graph model. In this paper we consider the geometric version of the problem, where all ...
ICCV
2011
IEEE
12 years 7 months ago
2011
IEEE
This paper addresses the problem of category-level image classification. The underlying image model is a graph whose nodes correspond to a dense set of regions, and edges reflec...
JCNS
2010
13 years 2 months ago
2010
Optimal filtering of noisy voltage signals on dendritic trees is a key problem in computational cellular neuroscience. However, the state variable in this problem -- the vector of...
ICIP
2010
IEEE
13 years 5 months ago
2010
IEEE
Motion estimation is known to be a non-convex optimization problem. This non-convexity comes from several ambiguities in motion estimation such as the aperture problem, or fast mo...
SDM
2009
SIAM
14 years 4 months ago
2009
SIAM
In this paper, we propose GAD (General Activity Detection) for fast clustering on large scale data. Within this framework we design a set of algorithms for different scenarios: (...