556 search results - page 57 / 112 » A Comparative Study of Some Generalized Rough Approximations |
131
click to vote
TALG
2010
14 years 8 months ago
2010
We study a generalization of the k-median problem with respect to an arbitrary dissimilarity measure D. Given a finite set P of size n, our goal is to find a set C of size k such t...
214
Voted
COMPGEOM
2011
ACM
14 years 5 months ago
2011
ACM
We propose a framework for compressive sensing of images with local geometric features. Specifically, let x ∈ RN be an N-pixel image, where each pixel p has value xp. The image...
104
click to vote
WWW
2008
ACM
16 years 2 months ago
2008
ACM
Web graphs are approximate snapshots of the web, created by search engines. Their creation is an error-prone procedure that relies on the availability of Internet nodes and the fa...
118
click to vote
INFOCOM
2005
IEEE
15 years 7 months ago
2005
IEEE
— We study a fixed point formalisation of the well known analysis of Bianchi [3]. We provide a significant simplification and generalisation of the analysis. In this more gene...
109
click to vote
CORR
2007
Springer
15 years 1 months ago
2007
Springer
Classical problems of sorting and searching assume an underlying linear ordering of the objects being compared. In this paper, we study a more general setting, in which some pairs...