1332 search results - page 15 / 267 » An Efficient Algorithm for the Approximate Median Selection ... |
227
click to vote
ICDE
2006
IEEE
16 years 5 months ago
2006
IEEE
In this paper, we propose DBSampler, a query execution mechanism to answer "partial selection" queries in peerto-peer databases. A partial selection query is an arbitrar...
112
Voted
JCO
2006
15 years 3 months ago
2006
We study minimum-cost sensor placement on a bounded 3D sensing field, R, which comprises a number of discrete points that may or may not be grid points. Suppose we have types of se...
138
Voted
DCG
2000
15 years 3 months ago
2000
We consider the problem of approximating a polygonal chain C by another polygonal chain C whose vertices are constrained to be a subset of the set of vertices of C. The goal is to ...
104
Voted
COMGEO
2010
ACM
15 years 3 months ago
2010
ACM
Clustering is an important problem and has numerous applications. In this paper we consider an important clustering problem, called the k-center problem. We are given a discrete p...
126
Voted
JCIT
2008
15 years 3 months ago
2008
This paper introduces a new computer-aided classification system for detection of prostate cancer in Transrectal Ultrasound images (TRUS). To increase the efficiency of the comput...