Sciweavers

1538 search results - page 100 / 308
» Relative Randomness and Cardinality
Sort
View
NAACL
2007
14 years 11 months ago
Worst-Case Synchronous Grammar Rules
We relate the problem of finding the best application of a Synchronous ContextFree Grammar (SCFG) rule during parsing to a Markov Random Field. This representation allows us to u...
Daniel Gildea, Daniel Stefankovic
AAAI
1994
14 years 11 months ago
In Search of the Best Constraint Satisfaction Search
We present the results of an empirical study of several constraint satisfaction search algorithms and heuristics. Using a random problem generator that allows us to create instanc...
Daniel Frost, Rina Dechter
COLOGNETWENTE
2010
14 years 8 months ago
Bisimplicial Edges in Bipartite Graphs
Bisimplicial edges in bipartite graphs are closely related to pivots in Gaussian elimination that avoid turning zeroes into non-zeroes. We present a new deterministic algorithm to...
Matthijs Bomhoff, Bodo Manthey
JOCN
2010
69views more  JOCN 2010»
14 years 4 months ago
Syntactic Unification Operations Are Reflected in Oscillatory Dynamics during On-line Sentence Comprehension
There is growing evidence suggesting that synchronization changes in the oscillatory neuronal dynamics in the EEG or MEG reflect the transient coupling and uncoupling of functiona...
Marcel C. M. Bastiaansen, Lilla Magyari, Peter Hag...
FOCS
2009
IEEE
15 years 4 months ago
Symmetry and Approximability of Submodular Maximization Problems
Abstract— A number of recent results on optimization problems involving submodular functions have made use of the ”multilinear relaxation” of the problem [3], [8], [24], [14]...
Jan Vondrák