Sciweavers

524 search results - page 50 / 105
» ets 2010
Sort
View
WG
2010
Springer
13 years 6 months ago
Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time
The problem of determining the cutwidth of a graph is a notoriously hard problem which remains NP-complete under severe restrictions on input graphs. Until recently, non-trivial p...
Pinar Heggernes, Pim van 't Hof, Daniel Lokshtanov...
COLT
2010
Springer
13 years 5 months ago
Learning to Create is as Hard as Learning to Appreciate
We explore the relationship between a natural notion of unsupervised learning studied by Kearns et al. (STOC '94), which we call here "learning to create" (LTC), an...
David Xiao
EMNLP
2010
13 years 5 months ago
Turbo Parsers: Dependency Parsing by Approximate Variational Inference
We present a unified view of two state-of-theart non-projective dependency parsers, both approximate: the loopy belief propagation parser of Smith and Eisner (2008) and the relaxe...
André F. T. Martins, Noah A. Smith, Eric P....
IH
2010
Springer
13 years 5 months ago
Short Collusion-Secure Fingerprint Codes against Three Pirates
In this article, we propose a new construction of probabilistic collusion-secure fingerprint codes against up to three pirates and give a theoretical security evaluation. Our pira...
Koji Nuida
MEMOCODE
2010
IEEE
13 years 5 months ago
Monitoring temporal SystemC properties
Monitoring temporal SystemC properties is crucial for the validation of functional and transaction-level models, yet the current SystemC standard provides no support for temporal s...
Deian Tabakov, Moshe Y. Vardi