Sciweavers

1337 search results - page 141 / 268
» Fast computation of distance estimators
Sort
View
CSDA
2007
114views more  CSDA 2007»
13 years 9 months ago
Relaxed Lasso
The Lasso is an attractive regularisation method for high dimensional regression. It combines variable selection with an efficient computational procedure. However, the rate of co...
Nicolai Meinshausen
VLDB
2001
ACM
139views Database» more  VLDB 2001»
14 years 1 months ago
NetCube: A Scalable Tool for Fast Data Mining and Compression
We propose an novel method of computing and storing DataCubes. Our idea is to use Bayesian Networks, which can generate approximate counts for any query combination of attribute v...
Dimitris Margaritis, Christos Faloutsos, Sebastian...
SI3D
2010
ACM
14 years 2 months ago
Real-time multi-agent path planning on arbitrary surfaces
Path planning is an active topic in the literature, and efficient navigation over non-planar surfaces is an open research question. In this work we present a novel technique for ...
Rafael P. Torchelsen, Luiz F. Scheidegger, Guilher...
ICPR
2004
IEEE
14 years 10 months ago
High Frequency Component Compensation based Super-Resolution Algorithm for Face Video Enhancement
This paper proposes a video-based super-resolution algorithm by high-frequency component compensation. Normalized logarithm distance (NLD) minimization on local shape feature is p...
Junwen Wu, Mohan M. Trivedi, Bhaskar D. Rao
ICCAD
2006
IEEE
152views Hardware» more  ICCAD 2006»
14 years 6 months ago
Fast and robust quadratic placement combined with an exact linear net model
— This paper presents a robust quadratic placement approach, which offers both high-quality placements and excellent computational efficiency. The additional force which distrib...
Peter Spindler, Frank M. Johannes