Sciweavers

2100 search results - page 70 / 420
» Fundamentals of the problem
Sort
View
JOC
2007
125views more  JOC 2007»
13 years 10 months ago
Deterministic Polynomial-Time Equivalence of Computing the RSA Secret Key and Factoring
Abstract. We address one of the most fundamental problems concerning the RSA cryptosystem: does the knowledge of the RSA public and secret key-pair (e, d) yield the factorization o...
Jean-Sébastien Coron, Alexander May
TSP
2008
96views more  TSP 2008»
13 years 10 months ago
A Consistent Metric for Performance Evaluation of Multi-Object Filters
The concept of a miss-distance, or error, between a reference quantity and its estimated/controlled value, plays a fundamental role in any filtering/control problem. Yet there is n...
D. Schuhmacher, Ba-Tuong Vo, Ba-Ngu Vo
JCSS
2002
95views more  JCSS 2002»
13 years 9 months ago
Efficient algorithms for locating the length-constrained heaviest segments with applications to biomolecular sequence analysis
We study two fundamental problems concerning the search for interesting regions in sequences: (i) given a sequence of real numbers of length n and an upper bound U; find a consecu...
Yaw-Ling Lin, Tao Jiang, Kun-Mao Chao
EMNLP
2009
13 years 8 months ago
A Compact Forest for Scalable Inference over Entailment and Paraphrase Rules
A large body of recent research has been investigating the acquisition and application of applied inference knowledge. Such knowledge may be typically captured as entailment rules...
Roy Bar-Haim, Jonathan Berant, Ido Dagan
CORR
2011
Springer
148views Education» more  CORR 2011»
13 years 5 months ago
How well can we estimate a sparse vector?
The estimation of a sparse vector in the linear model is a fundamental problem in signal processing, statistics, and compressive sensing. This paper establishes a lower bound on t...
Emmanuel J. Candès, Mark A. Davenport