Sciweavers

2031 search results - page 216 / 407
» On Tree-Constrained Matchings and Generalizations
Sort
View
75
Voted
FSTTCS
2007
Springer
15 years 5 months ago
Program Analysis Using Weighted Pushdown Systems
Abstract. Pushdown systems (PDSs) are an automata-theoretic formalism for specifying a class of infinite-state transition systems. Infiniteness comes from the fact that each con...
Thomas W. Reps, Akash Lal, Nicholas Kidd
94
Voted
SIGIR
2006
ACM
15 years 4 months ago
Combining bidirectional translation and synonymy for cross-language information retrieval
This paper introduces a general framework for the use of translation probabilities in cross-language information retrieval based on the notion that information retrieval fundament...
Jianqiang Wang, Douglas W. Oard
83
Voted
CASES
2001
ACM
15 years 2 months ago
Application specific architectures: a recipe for fast, flexible and power efficient designs
The general purpose processor has long been the focus of intense optimization efforts that have resulted in an impressive doubling of performance every 18 months. However, recent ...
Christopher T. Weaver, Rajeev Krishna, Lisa Wu, To...
CCS
2001
ACM
15 years 2 months ago
A verifiable secret shuffle and its application to e-voting
We present a mathematical construct which provides a cryptographic protocol to verifiably shuffle a sequence of k modular integers, and discuss its application to secure, universa...
C. Andrew Neff
89
Voted
COLT
1995
Springer
15 years 2 months ago
Regression NSS: An Alternative to Cross Validation
The Noise Sensitivity Signature (NSS), originally introduced by Grossman and Lapedes (1993), was proposed as an alternative to cross validation for selecting network complexity. I...
Michael P. Perrone, Brian S. Blais