Sciweavers

877 search results - page 40 / 176
» Structural Cut Elimination
Sort
View
147
Voted
ICML
2004
IEEE
16 years 5 months ago
Semi-supervised learning using randomized mincuts
In many application domains there is a large amount of unlabeled data but only a very limited amount of labeled training data. One general approach that has been explored for util...
Avrim Blum, John D. Lafferty, Mugizi Robert Rweban...
120
Voted
SODA
2001
ACM
105views Algorithms» more  SODA 2001»
15 years 6 months ago
Online point location in planar arrangements and its applications
Recently, Har-Peled [HP99b] presented a new randomized technique for online construction of the zone of a curve in a planar arrangement of arcs. In this paper, we present several ...
Sariel Har-Peled, Micha Sharir
129
Voted
CHI
2011
ACM
14 years 8 months ago
In the shadow of misperception: assistive technology use and social interactions
Few research studies focus on how the use of assistive technologies is affected by social interaction among people. We present an interview study of 20 individuals to determine ho...
Kristen Shinohara, Jacob O. Wobbrock
123
Voted
DAC
2010
ACM
15 years 9 months ago
An AIG-Based QBF-solver using SAT for preprocessing
In this paper we present a solver for Quantified Boolean Formulas (QBFs) which is based on And-Inverter Graphs (AIGs). We use a new quantifier elimination method for AIGs, which...
Florian Pigorsch, Christoph Scholl
FOCS
2008
IEEE
15 years 11 months ago
Submodular Approximation: Sampling-based Algorithms and Lower Bounds
We introduce several generalizations of classical computer science problems obtained by replacing simpler objective functions with general submodular functions. The new problems i...
Zoya Svitkina, Lisa Fleischer