15033 search results - page 2600 / 3007 » Complexity Theory and Algorithms |
230
click to vote
CIDR
2011
14 years 10 months ago
2011
Organizations like the Internet Archive have been capturing Web contents over decades, building up huge repositories of time-versioned pages. The timestamp annotations and the she...
308
click to vote
FOSSACS
2011
Springer
14 years 10 months ago
2011
Springer
Traditional automata accept or reject their input, and are therefore Boolean. In contrast, weighted automata map each word to a value from a semiring over a large domain. The speci...
248
click to vote
ICCV
2011
IEEE
14 years 6 months ago
2011
IEEE
Rank correlation measures are known for their resilience to perturbations in numeric values and are widely used in many evaluation metrics. Such ordinal measures have rarely been ...
224
click to vote
IACR
2011
14 years 6 months ago
2011
Sorting is among the most fundamental and well-studied problems within computer science and a core step of many algorithms. In this article, we consider the problem of constructing...
206
click to vote
IACR
2011
14 years 6 months ago
2011
Strong lattice reduction is the key element for most attacks against lattice-based cryptosystems. Between the strongest but impractical HKZ reduction and the weak but fast LLL redu...