1478 search results - page 128 / 296 » Modular Complexity Analysis via Relative Complexity |
109
click to vote
CCGRID
2004
IEEE
15 years 6 months 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...
121
click to vote
UAI
2008
15 years 3 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...
136
click to vote
NIPS
2004
15 years 3 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...
142
click to vote
ACL
2011
14 years 6 months 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...
129
Voted
AAAI
2010
15 years 13 days 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...