12052 search results - page 510 / 2411 » computing 2010 |
177
click to vote
ACL
2010
15 years 5 months ago
2010
A strong inductive bias is essential in unsupervised grammar induction. We explore a particular sparsity bias in dependency grammars that encourages a small number of unique depen...
421
click to vote
IWOCA
2010
Springer
15 years 1 months ago
2010
Springer
A path-based support of a hypergraph H is a graph with the same vertex set as H in which each hyperedge induces a Hamiltonian subgraph. While it is NP-complete to compute a path-ba...
180
click to vote
ENTCS
2002
15 years 6 months ago
2002
Classically, any absolute continuous real function is of bounded variation and hence can always be expressed as a difference of two increasing continuous functions (socalled Jorda...
150
click to vote
ASAP
2010
IEEE
15 years 8 months ago
2010
IEEE
urrence abstractions Arpith C. Jacob Jeremy D. Buhler Roger D. Chamberlain Arpith C. Jacob, Jeremy D. Buhler, and Roger D. Chamberlain, "Design of ut-optimized arrays from rec...
186
click to vote
FMSD
2010
15 years 5 months ago
2010
ASED ABSTRACTION-REFINEMENT FRAMEWORK FOR MARKOV DECISION PROCESSES Mark Kattenbelt Marta Kwiatkowska Gethin Norman David Parker CL-RR-08-06 Oxford University Computing Laborator...