1096 search results - page 102 / 220 » A New Approach for Speeding Up Enumeration Algorithms |
182
click to vote
ICASSP
2010
IEEE
15 years 4 months ago
2010
IEEE
This paper deals with the reconstruction of T1-T2 correlation spectra in Nuclear Magnetic Resonance (NMR) spectroscopy. The ill-posed character of this inverse problem and its lar...
158
click to vote
COCO
2005
Springer
15 years 12 months ago
2005
Springer
A t-private private information retrieval (PIR) scheme allows a user to retrieve the ith bit of an n-bit string x replicated among k servers, while any coalition of up to t server...
203
click to vote
IJCV
2011
15 years 1 months ago
2011
This paper is devoted to the optimization problem of continuous multipartitioning, or multi-labeling, which is based on a convex relaxation of the continuous Potts model. In contr...
162
click to vote
SIGMOD
2001
ACM
16 years 6 months ago
2001
ACM
Over the last decades, improvements in CPU speed have outpaced improvements in main memory and disk access rates by orders of magnitude, enabling the use of data compression techn...
178
click to vote
ICPR
2002
IEEE
16 years 7 months ago
2002
IEEE
: One way to scale up clustering algorithms is to squash the data by some intelligent compression technique and cluster only the compressed data records. Such compressed data recor...