Sciweavers

1389 search results - page 137 / 278
» Improved Approximation Algorithms for Label Cover Problems
Sort
View
COLING
2008
15 years 4 months ago
Exact Inference for Multi-label Classification using Sparse Graphical Models
This paper describes a parameter estimation method for multi-label classification that does not rely on approximate inference. It is known that multi-label classification involvin...
Yusuke Miyao, Jun-ichi Tsujii
SIAMNUM
2010
103views more  SIAMNUM 2010»
14 years 10 months ago
Hybridization and Postprocessing Techniques for Mixed Eigenfunctions
Abstract. We introduce hybridization and postprocessing techniques for the RaviartThomas approximation of second-order elliptic eigenvalue problems. Hybridization reduces the Ravia...
Bernardo Cockburn, Jayadeep Gopalakrishnan, F. Li,...
PODS
2004
ACM
143views Database» more  PODS 2004»
16 years 3 months ago
Approximate Counts and Quantiles over Sliding Windows
We consider the problem of maintaining approximate counts and quantiles over fixed- and variablesize sliding windows in limited space. For quantiles, we present deterministic algo...
Arvind Arasu, Gurmeet Singh Manku
159
Voted
FOCS
2004
IEEE
15 years 7 months ago
Stochastic Optimization is (Almost) as easy as Deterministic Optimization
Stochastic optimization problems attempt to model uncertainty in the data by assuming that (part of) the input is specified in terms of a probability distribution. We consider the...
David B. Shmoys, Chaitanya Swamy
96
Voted
JCP
2008
117views more  JCP 2008»
15 years 3 months ago
Selfish Constraint Satisfaction Genetic Algorithm for Planning a Long-distance Transportation Network
To build a cooperative logistics network covering multiple enterprises, a planning method that can build a long-distance transportation network is required. Many strict constraints...
Takashi Onoyama, Takuya Maekawa, Yoshitaka Sakurai...