Sciweavers

453 search results - page 72 / 91
» On Approximation of Bookmark Assignments
Sort
View
LREC
2010
203views Education» more  LREC 2010»
13 years 9 months ago
Arabic Parsing Using Grammar Transforms
We investigate Arabic Context Free Grammar parsing with dependency annotation comparing lexicalised and unlexicalised parsers. We study how morphosyntactic as well as function tag...
Lamia Tounsi, Josef van Genabith
SODA
2008
ACM
100views Algorithms» more  SODA 2008»
13 years 9 months ago
On allocations that maximize fairness
We consider a problem known as the restricted assignment version of the max-min allocation problem with indivisible goods. There are n items of various nonnegative values and m pl...
Uriel Feige
NIPS
2007
13 years 9 months ago
Bayesian Inference for Spiking Neuron Models with a Sparsity Prior
Generalized linear models are the most commonly used tools to describe the stimulus selectivity of sensory neurons. Here we present a Bayesian treatment of such models. Using the ...
Sebastian Gerwinn, Jakob Macke, Matthias Seeger, M...
ACID
2006
239views Algorithms» more  ACID 2006»
13 years 9 months ago
Stable Marriage with Ties and Bounded Length Preference Lists
We consider variants of the classical stable marriage problem in which preference lists may contain ties, and may be of bounded length. Such restrictions arise naturally in practic...
Robert W. Irving, David Manlove, Gregg O'Malley
UAI
2001
13 years 9 months ago
Exact Inference in Networks with Discrete Children of Continuous Parents
Many real life domains contain a mixture of discrete and continuous variables and can be modeled as hybrid Bayesian Networks (BNs). An important subclass of hybrid BNs are conditi...
Uri Lerner, Eran Segal, Daphne Koller