Sciweavers

3874 search results - page 425 / 775
» Approximation Algorithms for k-hurdle Problems
Sort
View
NIPS
1994
15 years 8 months ago
Efficient Methods for Dealing with Missing Data in Supervised Learning
We present efficient algorithms for dealing with the problem of missing inputs (incomplete feature vectors) during training and recall. Our approach is based on the approximation ...
Volker Tresp, Ralph Neuneier, Subutai Ahmad
ICA
2010
Springer
15 years 7 months ago
Dictionary Learning for Sparse Representations: A Pareto Curve Root Finding Approach
Abstract. A new dictionary learning method for exact sparse representation is presented in this paper. As the dictionary learning methods often iteratively update the sparse coeffi...
Mehrdad Yaghoobi, Mike E. Davies
JCO
2006
153views more  JCO 2006»
15 years 6 months ago
Efficient point coverage in wireless sensor networks
We study minimum-cost sensor placement on a bounded 3D sensing field, R, which comprises a number of discrete points that may or may not be grid points. Suppose we have types of se...
Jie Wang, Ning Zhong
CAD
2005
Springer
15 years 6 months ago
Industrial geometry: recent advances and applications in CAD
Industrial Geometry aims at unifying existing and developing new methods and algorithms for a variety of application areas with a strong geometric component. These include CAD, CA...
Helmut Pottmann, Stefan Leopoldseder, Michael Hofe...
ALGOSENSORS
2004
Springer
16 years 2 days ago
Balanced Data Gathering in Energy-Constrained Sensor Networks
We consider the problem of gathering data from a wireless multi-hop network of energy-constrained sensor nodes to a common base station. Specifically, we aim to balance the total...
Emil Falck, Patrik Floréen, Petteri Kaski, ...