7015 search results - page 1219 / 1403 » Approximation algorithms for co-clustering |
167
click to vote
GECCO
2007
Springer
16 years 16 days ago
2007
Springer
In this paper, we propose the combination of different optimization techniques in order to solve “hard” two- and threeobjective optimization problems at a relatively low comp...
211
click to vote
GPC
2007
Springer
16 years 16 days ago
2007
Springer
Sharing huge databases in distributed systems is inherently difficult. As the amount of stored data increases, data localization techniques become no longer sufficient. A more ef...
173
click to vote
ICALP
2007
Springer
16 years 16 days ago
2007
Springer
A spanner of an undirected unweighted graph is a subgraph that approximates the distance metric of the original graph with some specified accuracy. Specifically, we say H ⊆ G i...
171
click to vote
ICB
2007
Springer
16 years 16 days ago
2007
Springer
Abstract. Most of gait recognition algorithms involve walking cycle estimation to accomplish signature matching. However, we may be plagued by two cycle-related issues when develop...
153
click to vote
IH
2007
Springer
16 years 16 days ago
2007
Springer
In this paper, we describe a new forensic tool for revealing digitally altered images by detecting the presence of photo-response non-uniformity noise (PRNU) in small regions. This...