7289 search results - page 376 / 1458 » A Dependent Set Theory |
199
Voted
FOIKS
2008
Springer
15 years 8 months ago
2008
Springer
When decomposing database schemas, it is desirable that a decomposition is lossless and dependency preserving. A well-known and frequently used result for the relational model stat...
182
click to vote
NETWORKING
2007
15 years 8 months ago
2007
We consider event dependent routing algorithms for on-line explicit source routing in MPLS networks. The proposed methods are based on load shared sequential routing in which load ...
238
Voted
ACL
2011
14 years 10 months ago
2011
We propose a non-parametric Bayesian model for unsupervised semantic parsing. Following Poon and Domingos (2009), we consider a semantic parsing setting where the goal is to (1) d...
224
click to vote
EMMCVPR
2011
Springer
14 years 6 months ago
2011
Springer
Traditional approaches to Multiple-Instance Learning (MIL) operate under the assumption that the instances of a bag are generated independently, and therefore typically learn an in...
179
click to vote
ACL
2012
13 years 9 months ago
2012
Prepositions and conjunctions are two of the largest remaining bottlenecks in parsing. Across various existing parsers, these two categories have the lowest accuracies, and mistak...