Sciweavers

297 search results - page 29 / 60
» On the Fastest Vickrey Algorithm
Sort
View
AAECC
1990
Springer
100views Algorithms» more  AAECC 1990»
13 years 11 months ago
Duality between Two Cryptographic Primitives
This paper reveals a duality between constructions of two basic cryptographic primitives, pseudo-random string generators and one-way hash functions. Applying the duality, we pres...
Yuliang Zheng, Tsutomu Matsumoto, Hideki Imai
DAC
2005
ACM
13 years 9 months ago
TCAM enabled on-chip logic minimization
This paper presents an eļ¬ƒcient hardware architecture of an on-chip logic minimization coprocessor. The proposed architecture employs TCAM cells to provide fastest and memory eļ¬...
Seraj Ahmad, Rabi N. Mahapatra
AAAI
2006
13 years 8 months ago
Probabilistic Temporal Planning with Uncertain Durations
Few temporal planners handle both concurrency and uncertain durations, but these features commonly co-occur in realworld domains. In this paper, we discuss the challenges caused b...
Mausam, Daniel S. Weld
SBBD
2004
82views Database» more  SBBD 2004»
13 years 8 months ago
Optimizing Ranking Calculation in Web Search Engines: a Case Study
Web search engines compete to offer the fastest responses with highest relevance. However, as Web collections grow, it becomes more difficult to achieve this purpose. As most user...
Miguel Costa, Mário J. Silva
ALGORITHMICA
2008
52views more  ALGORITHMICA 2008»
13 years 7 months ago
From Constrained to Unconstrained Maximum Agreement Subtree in Linear Time
We propose and study the Maximum Constrained Agreement Subtree (MCAST) problem, which is a variant of the classical Maximum Agreement Subtree (MAST) problem. Our problem allows us...
V. Berry, Z. S. Peng, H. F. Ting