Sciweavers

59 search results - page 12 / 12
» A Probabilistic Model for Chord Progressions
Sort
View
EUROCRYPT
2004
Springer
13 years 10 months ago
Positive Results and Techniques for Obfuscation
Informally, an obfuscator O is an efficient, probabilistic “compiler” that transforms a program P into a new program O(P) with the same functionality as P, but such that O(P)...
Ben Lynn, Manoj Prabhakaran, Amit Sahai
SIGMOD
2010
ACM
170views Database» more  SIGMOD 2010»
13 years 9 months ago
Querying data provenance
Many advanced data management operations (e.g., incremental maintenance, trust assessment, debugging schema mappings, keyword search over databases, or query answering in probabil...
Grigoris Karvounarakis, Zachary G. Ives, Val Tanne...
EACL
2003
ACL Anthology
13 years 6 months ago
Topological Parsing
We present a new grammar formalism for parsing with freer word-order languages, motivated by recent linguistic research in German and the Slavic languages. Unlike CFGs, these gram...
Gerald Penn, Mohammad Haji-Abdolhosseini
CORR
2010
Springer
172views Education» more  CORR 2010»
13 years 4 months ago
Seeing Through Black Boxes : Tracking Transactions through Queues under Monitoring Resource Constraints
The problem of optimal allocation of monitoring resources for tracking transactions progressing through a distributed system, modeled as a queueing network, is considered. Two for...
Animashree Anandkumar, Ting He, Chatschik Bisdikia...