3946 search results - page 252 / 790 » The computational complexity of choice sets |
186
click to vote
ACISP
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. Many algorithmic problems, which are used to prove the security of a cryptographic system, are shown to be characterized as the subgroup membership problem. We then apply...
225
click to vote
MOBISYS
2006
ACM
16 years 6 months ago
2006
ACM
There is a fair amount of evidence that mesh (static multihop wireless) networks are gaining popularity, both in the academic literature and in the commercial space. Nonetheless, ...
193
click to vote
CIVR
2007
Springer
16 years 27 days ago
2007
Springer
Bag-of-features (BoF) deriving from local keypoints has recently appeared promising for object and scene classification. Whether BoF can naturally survive the challenges such as ...
184
click to vote
COLT
1999
Springer
15 years 11 months ago
1999
Springer
We present a unified framework for reasoning about worst-case regret bounds for learning algorithms. This framework is based on the theory of duality of convex functions. It brin...
192
click to vote
BMCBI
2007
15 years 6 months ago
2007
Background: Identifying syntenic regions, i.e., blocks of genes or other markers with evolutionary conserved order, and quantifying evolutionary relatedness between genomes in ter...