900 search results - page 19 / 180 » On Polynomial Time Computation over Unordered Structures |
142
click to vote
CORR
2011
Springer
14 years 9 months ago
2011
Springer
We consider a class of learning problems regularized by a structured sparsity-inducing norm defined as the sum of 2- or ∞-norms over groups of variables. Whereas much effort ha...
103
click to vote
FOCS
2005
IEEE
15 years 7 months ago
2005
IEEE
We consider the problem of learning mixtures of product distributions over discrete domains in the distribution learning framework introduced by Kearns et al. [18]. We give a poly...
131
click to vote
RECOMB
2006
Springer
16 years 2 months ago
2006
Springer
Abstract. Preliminary to most comparative genomics studies is the annotation of chromosomes as ordered sequences of genes. Unfortunately, different genetic mapping techniques usual...
188
click to vote
ECCV
2010
Springer
14 years 11 months ago
2010
Springer
Abstract. Graph cuts has emerged as a preferred method to solve a class of energy minimization problems in computer vision. It has been shown that graph cut algorithms designed kee...
122
click to vote
MDM
2004
Springer
15 years 7 months ago
2004
Springer
Data broadcasting is well known for its excellent scalability. Multi-dimensional range queries, such as spatial range queries of geographical information for location dependent se...