4047 search results - page 749 / 810 » The Discrete Basis Problem |
108
click to vote
DCC
2004
IEEE
16 years 3 months ago
2004
IEEE
Many technical imaging applications, like coding "images" of digital elevation maps, require extracting regions of compressed images in which the pixel values are within...
107
click to vote
SODA
2010
ACM
16 years 26 days ago
2010
ACM
abstract Subhash Khot Assaf Naor In the kernel clustering problem we are given a (large) n ? n symmetric positive semidefinite matrix A = (aij) with n i=1 n j=1 aij = 0 and a (sma...
170
Voted
SODA
2010
ACM
16 years 26 days ago
2010
ACM
We present a simple and practical algorithm for the c-approximate near neighbor problem (c-NN): given n points P Rd and radius R, build a data structure which, given q Rd , can ...
120
Voted
SODA
2010
ACM
16 years 26 days ago
2010
ACM
Detecting and counting the number of copies of certain subgraphs (also known as network motifs or graphlets), is motivated by applications in a variety of areas ranging from Biolo...
127
click to vote
SODA
2010
ACM
16 years 26 days ago
2010
ACM
There has been great interest in deciding whether a combinatorial structure satisfies some property, or in estimating the value of some numerical function associated with this com...