4843 search results - page 266 / 969 » The Shortcut Problem - Complexity and Approximation |
123
click to vote
IMA
2007
Springer
15 years 10 months ago
2007
Springer
Non-linear cryptanalysis is a natural extension to Matsui’s linear cryptanalitic techniques in which linear approximations are replaced by nonlinear expressions. Non-linear appro...
137
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
d Abstract) Sara Ahmadian∗ Chaitanya Swamy∗ We consider the lower-bounded facility location (LBFL) problem (also sometimes called load-balanced facility location), which is a ...
243
click to vote
SIGMOD
2008
ACM
16 years 3 months ago
2008
ACM
Approximate queries on a collection of strings are important in many applications such as record linkage, spell checking, and Web search, where inconsistencies and errors exist in...
173
click to vote
COMGEO
2004
ACM
15 years 3 months ago
2004
ACM
In k-means clustering we are given a set of n data points in d-dimensional space d and an integer k, and the problem is to determine a set of k points in d , called centers, to mi...
155
click to vote
SODA
2012
ACM
13 years 6 months ago
2012
ACM
The problem of approximating convex bodies by polytopes is an important and well studied problem. Given a convex body K in Rd , the objective is to minimize the number of vertices...