Sciweavers

7106 search results - page 428 / 1422
» Restricted Complexity, General Complexity
Sort
View
JMLR
2010
144views more  JMLR 2010»
15 years 2 months ago
Maximum Margin Learning with Incomplete Data: Learning Networks instead of Tables
In this paper we address the problem of predicting when the available data is incomplete. We show that changing the generally accepted table-wise view of the sample items into a g...
Sándor Szedmák, Yizhao Ni, Steve R. ...
CORR
2011
Springer
166views Education» more  CORR 2011»
14 years 11 months ago
A family of fast-decodable MIDO codes from crossed-product algebras over Q
—Multiple Input Double Output (MIDO) asymmetric space-time codes for 4 transmit antennas and 2 receive antennas can be employed in the downlink from base stations to portable dev...
Laura Luzzi, Frédérique E. Oggier
COMPGEOM
2011
ACM
14 years 11 months ago
An output-sensitive algorithm for persistent homology
In this paper, we present the first output-sensitive algorithm to compute the persistence diagram of a filtered simplicial complex. For any Γ > 0, it returns only those homo...
Chao Chen, Michael Kerber
EDBT
2011
ACM
225views Database» more  EDBT 2011»
14 years 11 months ago
On (not) indexing quadratic form distance by metric access methods
The quadratic form distance (QFD) has been utilized as an effective similarity function in multimedia retrieval, in particular, when a histogram representation of objects is used...
Tomás Skopal, Tomás Bartos, Jakub Lo...
PODC
2011
ACM
14 years 10 months ago
MIS on trees
A maximal independent set on a graph is an inclusion-maximal set of mutually non-adjacent nodes. This basic symmetry breaking structure is vital for many distributed algorithms, w...
Christoph Lenzen, Roger Wattenhofer