Sciweavers

227 search results - page 40 / 46
» Approximation of the Quadratic Set Covering problem
Sort
View
CONSTRAINTS
2007
46views more  CONSTRAINTS 2007»
13 years 7 months ago
Local-search Extraction of MUSes
SAT is probably one of the most-studied constraint satisfaction problems. In this paper, a new hybrid technique based on local search is introduced in order to approximate and ext...
Éric Grégoire, Bertrand Mazure, C&ea...
SIGMOD
2008
ACM
140views Database» more  SIGMOD 2008»
13 years 7 months ago
Near-optimal algorithms for shared filter evaluation in data stream systems
We consider the problem of evaluating multiple overlapping queries defined on data streams, where each query is a conjunction of multiple filters and each filter may be shared acr...
Zhen Liu, Srinivasan Parthasarathy 0002, Anand Ran...
JCSS
2008
138views more  JCSS 2008»
13 years 7 months ago
Reducing mechanism design to algorithm design via machine learning
We use techniques from sample-complexity in machine learning to reduce problems of incentive-compatible mechanism design to standard algorithmic questions, for a broad class of re...
Maria-Florina Balcan, Avrim Blum, Jason D. Hartlin...
ICANN
2009
Springer
14 years 8 hour ago
An EM Based Training Algorithm for Recurrent Neural Networks
Recurrent neural networks serve as black-box models for nonlinear dynamical systems identification and time series prediction. Training of recurrent networks typically minimizes t...
Jan Unkelbach, Yi Sun, Jürgen Schmidhuber
IJBRA
2008
66views more  IJBRA 2008»
13 years 7 months ago
Integer programming-based approach to allocation of reporter genes for cell array analysis
Abstract Observing behaviors of protein pathways and genetic networks under various environments in living cells is essential for unraveling disease and developing drugs. For that ...
Morihiro Hayashida, Fuyan Sun, Sachiyo Aburatani, ...