1717 search results - page 72 / 344 » A Computable Spectral Theorem |
167
click to vote
NIPS
2007
15 years 5 months ago
2007
Learning the common structure shared by a set of supervised tasks is an important practical and theoretical problem. Knowledge of this structure may lead to better generalization ...
151
click to vote
GRAPHICSINTERFACE
2001
15 years 5 months ago
2001
Digital watermarking embeds a structure called watermark into the target data, such as image and 3D polygonal models. The watermark can be used, for example, to enforce copyright ...
132
click to vote
ICALP
2007
Springer
15 years 10 months ago
2007
Springer
Following the idea developed by I. Simon in his theorem of Ramseyan factorisation forests, we develop a result of ‘deterministic factorisations’. This extra determinism propert...
154
click to vote
ICALP
2009
Springer
16 years 4 months ago
2009
Springer
Estimating frequency moments and Lp distances are well studied problems in the adversarial data stream model and tight space bounds are known for these two problems. There has been...
127
click to vote
FOCS
2004
IEEE
15 years 7 months ago
2004
IEEE
Given an undirected multigraph G and a subset of vertices S V (G), the STEINER TREE PACKING problem is to find a largest collection of edge-disjoint trees that each connects S. T...