Sciweavers

958 search results - page 88 / 192
» Resolving the Micropayment Problem
Sort
View
AUTOMATICA
2006
112views more  AUTOMATICA 2006»
14 years 10 months ago
Joint identification of plant rational models and noise distribution functions using binary-valued observations
System identification of plants with binary-valued output observations is of importance in understanding modeling capability and limitations for systems with limited sensor inform...
Le Yi Wang, Gang George Yin, Ji-Feng Zhang
JAIR
2006
115views more  JAIR 2006»
14 years 10 months ago
Temporal Planning using Subgoal Partitioning and Resolution in SGPlan
In this paper, we present the partitioning of mutual-exclusion (mutex) constraints in temporal planning problems and its implementation in the SGPlan4 planner. Based on the strong...
Yixin Chen, Benjamin W. Wah, Chih-Wei Hsu
ECCC
2007
123views more  ECCC 2007»
14 years 10 months ago
Lossy Trapdoor Functions and Their Applications
We propose a general cryptographic primitive called lossy trapdoor functions (lossy TDFs), and use it to develop new approaches for constructing several important cryptographic to...
Chris Peikert, Brent Waters
AIR
2004
130views more  AIR 2004»
14 years 10 months ago
A Hybrid Framework for Over-Constrained Generalized
Abstract. In this work we study an over-constrained scheduling problem where constraints cannot be relaxed. This problem originates from a local defense agency where activities to ...
Andrew Lim, Brian Rodrigues, Ramesh Thangarajo, Fe...
CORR
2008
Springer
117views Education» more  CORR 2008»
14 years 8 months ago
Complexity of Decoding Positive-Rate Reed-Solomon Codes
Abstract. The complexity of maximum likelihood decoding of the ReedSolomon codes [q -1, k]q is a well known open problem. The only known result [4] in this direction states that it...
Qi Cheng, Daqing Wan