1136 search results - page 193 / 228 » Finding Small Holes |
SODA
2010
ACM
14 years 6 months 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...
ICCD
2001
IEEE
14 years 5 months ago
2001
IEEE
The general-purpose precise interrupt mechanism, which has long been used to handle exceptional conditions that occur infrequently, is now being used increasingly often to handle ...
IUI
2009
ACM
14 years 5 months ago
2009
ACM
Recent years have seen a resurgence of interest in programming by demonstration. As end users have become increasingly sophisticated, computer and artificial intelligence technolo...
ICDE
2010
IEEE
14 years 3 months ago
2010
IEEE
— Finding the k nearest neighbors (kNN) of a query point, or a set of query points (kNN-Join) are fundamental problems in many application domains. Many previous efforts to solve...
ICC
2009
IEEE
14 years 3 months ago
2009
IEEE
— This paper presents a simple method for computing throughputs of links in a CSMA network. We call our method back-of-the-envelop (BoE) computation, because for many network con...