Sciweavers

441 search results - page 25 / 89
» A Method for Proving Observational Equivalence
Sort
View
FMSD
2000
80views more  FMSD 2000»
13 years 8 months ago
Delay-Insensitivity and Semi-Modularity
The study of asynchronous circuit behaviors in the presence of component and wire delays has received a great deal of attention. In this paper, we consider asynchronous circuits wh...
Janusz A. Brzozowski, Hao Zhang 0002
WWW
2008
ACM
14 years 9 months ago
Automatic web image selection with a probabilistic latent topic model
We propose a new method to select relevant images to the given keywords from images gathered from the Web based on the Probabilistic Latent Semantic Analysis (PLSA) model which is...
Keiji Yanai
AAAI
1990
13 years 10 months ago
Probabilistic Semantics for Cost Based Abduction
Cost-based abduction attempts to find the best explanation for a set of facts by finding a minimal cost proof for the facts. The costs are computed by summing the costs of the ass...
Eugene Charniak, Solomon Eyal Shimony
TREC
2000
13 years 10 months ago
TREC-9 CLIR at CUHK: Disambiguation by Similarity Values Between Adjacent Words
We investigated the dictionary-based query translation method combining the translation disambiguation process using statistic cooccurrence information trained from the provided c...
Honglan Jin, Kam-Fai Wong
CORR
2008
Springer
108views Education» more  CORR 2008»
13 years 9 months ago
Resolution Trees with Lemmas: Resolution Refinements that Characterize DLL Algorithms with Clause Learning
Resolution refinements called w-resolution trees with lemmas (WRTL) and with input lemmas (WRTI) are introduced. Dag-like resolution is equivalent to both WRTL and WRTI when there...
Samuel R. Buss, Jan Hoffmann 0002, Jan Johannsen