Sciweavers

3894 search results - page 433 / 779
» Approximation Algorithms for Biclustering Problems
Sort
View
STRINGOLOGY
2004
15 years 6 months ago
BDD-Based Analysis of Gapped q-Gram Filters
Recently, there has been a surge of interest in gapped q-gram filters for approximate string matching. Important design parameters for filters are for example the value of q, the f...
Marc Fontaine, Stefan Burkhardt, Juha Kärkk&a...
CORR
2011
Springer
177views Education» more  CORR 2011»
14 years 11 months ago
A Truthful Randomized Mechanism for Combinatorial Public Projects via Convex Optimization
In Combinatorial Public Projects, there is a set of projects that may be undertaken, and a set of selfinterested players with a stake in the set of projects chosen. A public plann...
Shaddin Dughmi
JDA
2011
90views more  JDA 2011»
14 years 11 months ago
Pattern matching in pseudo real-time
It has recently been shown how to construct online, non-amortised approximate pattern matching algorithms for a class of problems whose distance functions can be classified as be...
Raphaël Clifford, Benjamin Sach
ALGOSENSORS
2004
Springer
15 years 10 months 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, ...
NIPS
1994
15 years 6 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