Sciweavers

1631 search results - page 182 / 327
» Uniform Distributed Synthesis
Sort
View
126
Voted
APPROX
2008
Springer
101views Algorithms» more  APPROX 2008»
15 years 5 months ago
Learning Random Monotone DNF
We give an algorithm that with high probability properly learns random monotone DNF with t(n) terms of length log t(n) under the uniform distribution on the Boolean cube {0, 1}n ....
Jeffrey C. Jackson, Homin K. Lee, Rocco A. Servedi...
DSOM
2006
Springer
15 years 5 months ago
A WSDM-Based Architecture for Global Usage Characterization of Grid Computing Infrastructures
Current solutions to characterize grid computing usage are limited in three important aspects. First, they do not provide a global, uniform view of the use of infrastructures compr...
Glauco Antonio Ludwig, Luciano Paschoal Gaspary, G...
CPAIOR
2008
Springer
15 years 5 months ago
Counting Solutions of Knapsack Constraints
Abstract. This paper furthers the recent investigation of search heuristics based on solution counting information, by proposing and evaluating algorithms to compute solution densi...
Gilles Pesant, Claude-Guy Quimper
COLING
2008
15 years 4 months ago
Weakly Supervised Supertagging with Grammar-Informed Initialization
Much previous work has investigated weak supervision with HMMs and tag dictionaries for part-of-speech tagging, but there have been no similar investigations for the harder proble...
Jason Baldridge
129
Voted
WICON
2008
15 years 4 months ago
A negotiation game for multichannel access in cognitive radio networks
We consider the problem of efficient opportunistic spectrum access in cognitive radio networks where there are multiple secondary users trying to share access to multiple channels...
Hua Liu, Longbo Huang, Bhaskar Krishnamachari, Qin...