Sciweavers

3628 search results - page 618 / 726
» The Decision Diffie-Hellman Problem
Sort
View
112
Voted
LFP
1994
129views more  LFP 1994»
15 years 5 months ago
Static Dependent Costs for Estimating Execution Time
We present the rst system for estimating and using datadependent expression execution times in a language with rst-class procedures and imperative constructs. The presence of rst-...
Brian Reistad, David K. Gifford
125
Voted
NAACL
1994
15 years 5 months ago
Building Japanese-English Dictionary based on Ontology for Machine Translation
This paper describes a semi-automatic method for associating a Japanese lexicon with a semantic concept taxonomy called an ontology, using a Japanese-English bilingual dictionary ...
Akitoshi Okumura, Eduard H. Hovy
152
Voted
ATAL
2010
Springer
15 years 4 months ago
Point-based backup for decentralized POMDPs: complexity and new algorithms
Decentralized POMDPs provide an expressive framework for sequential multi-agent decision making. Despite their high complexity, there has been significant progress in scaling up e...
Akshat Kumar, Shlomo Zilberstein
112
Voted
CIDR
2009
136views Algorithms» more  CIDR 2009»
15 years 4 months ago
The Role of Schema Matching in Large Enterprises
To date, the principal use case for schema matching research has been as a precursor for code generation, i.e., constructing mappings between schema elements with the end goal of ...
Ken Smith, Michael Morse, Peter Mork, Maya Hao Li,...
124
Voted
ETS
2010
IEEE
150views Hardware» more  ETS 2010»
15 years 4 months ago
Improving CNF representations in SAT-based ATPG for industrial circuits using BDDs
It was shown in the past that ATPG based on the Boolean Satisfiability problem is a beneficial complement to traditional ATPG techniques. Its advantages can be observed especially ...
Daniel Tille, Stephan Eggersglüß, Rene ...