Sciweavers

2654 search results - page 169 / 531
» On Pairing Inversion Problems
Sort
View
JMLR
2012
13 years 8 months ago
Exact Covariance Thresholding into Connected Components for Large-Scale Graphical Lasso
We consider the sparse inverse covariance regularization problem or graphical lasso with regularization parameter λ. Suppose the sample covariance graph formed by thresholding th...
Rahul Mazumder, Trevor Hastie
FOSSACS
2007
Springer
16 years 17 days ago
Complexity Results on Balanced Context-Free Languages
Abstract. Some decision problems related to balanced context-free languages are important for their application to the static analysis of programs generating XML strings. One such ...
Akihiko Tozawa, Yasuhiko Minamide
PODS
2006
ACM
108views Database» more  PODS 2006»
16 years 6 months ago
Deterministic k-set structure
A k-set structure over data streams is a bounded-space data structure that supports stream insertion and deletion operations and returns the set of (item, frequency) pairs in the s...
Sumit Ganguly, Anirban Majumder
CORR
2011
Springer
181views Education» more  CORR 2011»
15 years 1 months ago
On Isolating Points Using Disks
In this paper, we consider the problem of choosing disks (that we can think of as corresponding to wireless sensors) so that given a set of input points in the plane, there exists ...
Matt Gibson, Gaurav Kanade, Kasturi R. Varadarajan
CVPR
2001
IEEE
16 years 8 months ago
On Solving 2D and 3D Puzzles Using Curve Matching
We approach the problem of 2-D and 3-D puzzle solving by matching the geometric features of puzzle pieces three at a time. First, we define an affinity measure for a pair of piece...
Weixin Kong, Benjamin B. Kimia