Sciweavers

218 search results - page 13 / 44
» Strong Bounds Consistencies and Their Application to Linear ...
Sort
View
AUTOMATICA
2008
139views more  AUTOMATICA 2008»
13 years 7 months ago
Structured low-rank approximation and its applications
Fitting data by a bounded complexity linear model is equivalent to low-rank approximation of a matrix constructed from the data. The data matrix being Hankel structured is equival...
Ivan Markovsky
WEA
2010
Springer
330views Algorithms» more  WEA 2010»
14 years 2 months ago
Exact Bipartite Crossing Minimization under Tree Constraints
A tanglegram consists of a pair of (not necessarily binary) trees T1, T2 with leaf sets L1, L2. Additional edges, called tangles, may connect nodes in L1 with those in L2. The task...
Frank Baumann, Christoph Buchheim, Frauke Liers
ESA
2006
Springer
140views Algorithms» more  ESA 2006»
13 years 11 months ago
Latency Constrained Aggregation in Sensor Networks
A sensor network consists of sensing devices which may exchange data through wireless communication. A particular feature of sensor networks is that they are highly energy constrai...
Luca Becchetti, Peter Korteweg, Alberto Marchetti-...
CSDA
2007
100views more  CSDA 2007»
13 years 7 months ago
Estimation in a linear multivariate measurement error model with a change point in the data
A linear multivariate measurement error model AX = B is considered. The errors in A B are row-wise finite dependent, and within each row, the errors may be correlated. Some of th...
Alexander Kukush, Ivan Markovsky, Sabine Van Huffe...
COLT
2004
Springer
14 years 26 days ago
An Inequality for Nearly Log-Concave Distributions with Applications to Learning
Abstract— We prove that given a nearly log-concave distribution, in any partition of the space to two well separated sets, the measure of the points that do not belong to these s...
Constantine Caramanis, Shie Mannor