1478 search results - page 128 / 296 » Modular Complexity Analysis via Relative Complexity |
CCGRID
2004
IEEE
14 years 28 days ago
2004
IEEE
We conduct computer simulation experiments in pre-operative planning of vascular reconstruction with a physician in the experimental loop. We constructed a problem-solving environ...
UAI
2008
13 years 10 months ago
2008
The paper introduces a generalization for known probabilistic models such as log-linear and graphical models, called here multiplicative models. These models, that express probabi...
NIPS
2004
13 years 10 months ago
2004
Embedding algorithms search for low dimensional structure in complex data, but most algorithms only handle objects of a single type for which pairwise distances are specified. Thi...
ACL
2011
13 years 24 days ago
2011
Via an oracle experiment, we show that the upper bound on accuracy of a CCG parser is significantly lowered when its search space is pruned using a supertagger, though the supert...
AAAI
2010
13 years 7 months ago
2010
We consider the problem of manipulating elections via cloning candidates. In our model, a manipulator can replace each candidate c by one or more clones, i.e., new candidates that...