Sciweavers

2576 search results - page 98 / 516
» The Complexity of Zero Knowledge
Sort
View
ISLPED
2006
ACM
140views Hardware» more  ISLPED 2006»
15 years 10 months ago
L-CBF: a low-power, fast counting bloom filter architecture
—An increasing number of architectural techniques rely on hardware counting bloom filters (CBFs) to improve upon the enegy, delay and complexity of various processor structures. ...
Elham Safi, Andreas Moshovos, Andreas G. Veneris
HICSS
2005
IEEE
188views Biometrics» more  HICSS 2005»
15 years 10 months ago
Consumer Search Behavior in Online Shopping Environments
This paper explores search behavior of online shoppers. Information economics literature suggests that search cost in electronic markets has essentially been reduced to zero as co...
Nanda Kumar, Karl Reiner Lang, Qian Peng
HYBRID
2005
Springer
15 years 10 months ago
Existence of Cascade Discrete-Continuous State Estimators for Systems on a Partial Order
In this paper, a cascade discrete-continuous state estimator on a partial order is proposed and its existence investigated. The continuous state estimation error is bounded by a mo...
Domitilla Del Vecchio, Richard M. Murray
WAOA
2005
Springer
170views Algorithms» more  WAOA 2005»
15 years 10 months ago
On Approximating Restricted Cycle Covers
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set...
Bodo Manthey
ISSAC
2004
Springer
135views Mathematics» more  ISSAC 2004»
15 years 9 months ago
Absolute polynomial factorization in two variables and the knapsack problem
A recent algorithmic procedure for computing the absolute factorization of a polynomial P(X, Y ), after a linear change of coordinates, is via a factorization modulo X3 . This was...
Guillaume Chèze