Sciweavers

3818 search results - page 438 / 764
» Word Problems on Compressed Words
Sort
View
ACL
2012
13 years 9 months ago
Aspect Extraction through Semi-Supervised Modeling
Aspect extraction is a central problem in sentiment analysis. Current methods either extract aspects without categorizing them, or extract and categorize them using unsupervised t...
Arjun Mukherjee, Bing Liu 0001
ICDT
2012
ACM
226views Database» more  ICDT 2012»
13 years 9 months ago
Bounded repairability for regular tree languages
We consider the problem of repairing unranked trees (e.g., XML documents) satisfying a given restriction specification R (e.g., a DTD) into unranked trees satisfying a given targ...
Gabriele Puppis, Cristian Riveros, Slawek Staworko
JCSS
2008
138views more  JCSS 2008»
15 years 6 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...
TALG
2010
86views more  TALG 2010»
15 years 5 months ago
Approximating corridors and tours via restriction and relaxation techniques
Given a rectangular boundary partitioned into rectangles, the Minimum-Length Corridor (MLC-R) problem consists of finding a corridor of least total length. A corridor is a set of ...
Arturo Gonzalez-Gutierrez, Teofilo F. Gonzalez
APPROX
2010
Springer
188views Algorithms» more  APPROX 2010»
15 years 8 months ago
Approximation Algorithms for Reliable Stochastic Combinatorial Optimization
We consider optimization problems that can be formulated as minimizing the cost of a feasible solution wT x over an arbitrary combinatorial feasible set F {0, 1}n . For these pro...
Evdokia Nikolova