3894 search results - page 355 / 779 » Approximation Algorithms for Biclustering Problems |
144
click to vote
CRYPTO
2006
Springer
15 years 9 months ago
2006
Springer
Abstract Lattice reduction is a hard problem of interest to both publickey cryptography and cryptanalysis. Despite its importance, extremely few algorithms are known. The best algo...
168
click to vote
TCS
2008
15 years 6 months ago
2008
The medial axis is a classical representation of digital objects widely used in many applications. However, such a set of balls may not be optimal: subsets of the medial axis may ...
148
click to vote
ECCC
2008
15 years 6 months ago
2008
Given a set of observed economic choices, can one infer preferences and/or utility functions for the players that are consistent with the data? Questions of this type are called r...
157
click to vote
GECCO
2007
Springer
16 years 8 days ago
2007
Springer
Real life optimization problems often require finding optimal solution to complex high dimensional, multimodal problems involving computationally very expensive fitness function e...
171
Voted
ICDE
2012
IEEE
13 years 8 months ago
2012
IEEE
— We consider how to support a large number of users over a wide-area network whose interests are characterized by range top-k continuous queries. Given an object update, we need...