Sciweavers

10040 search results - page 1855 / 2008
» Distributed participatory design
Sort
View
STOC
2004
ACM
150views Algorithms» more  STOC 2004»
16 years 3 months ago
Typical properties of winners and losers in discrete optimization
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...
René Beier, Berthold Vöcking
STOC
2003
ACM
171views Algorithms» more  STOC 2003»
16 years 3 months ago
Primal-dual meets local search: approximating MST's with nonuniform degree bounds
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
Jochen Könemann, R. Ravi
116
Voted
STOC
2001
ACM
123views Algorithms» more  STOC 2001»
16 years 3 months ago
On optimal slicing of parallel programs
Optimal program slicing determines for a statement S in a program whether or not S affects a specified set of statements, given that all conditionals in are interpreted as non-d...
Markus Müller-Olm, Helmut Seidl
SIGMOD
2009
ACM
190views Database» more  SIGMOD 2009»
16 years 3 months ago
Optimizing complex extraction programs over evolving text data
Most information extraction (IE) approaches have considered only static text corpora, over which we apply IE only once. Many real-world text corpora however are dynamic. They evol...
Fei Chen 0002, Byron J. Gao, AnHai Doan, Jun Yang ...
SIGMOD
2008
ACM
101views Database» more  SIGMOD 2008»
16 years 3 months ago
Pay-as-you-go user feedback for dataspace systems
A primary challenge to large-scale data integration is creating semantic equivalences between elements from different data sources that correspond to the same real-world entity or...
Shawn R. Jeffery, Michael J. Franklin, Alon Y. Hal...
« Prev « First page 1855 / 2008 Last » Next »