Sciweavers

556 search results - page 57 / 112
» A Comparative Study of Some Generalized Rough Approximations
Sort
View
TALG
2010
158views more  TALG 2010»
15 years 24 days ago
Clustering for metric and nonmetric distance measures
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...
Marcel R. Ackermann, Johannes Blömer, Christi...
COMPGEOM
2011
ACM
14 years 9 months ago
Compressive sensing with local geometric features
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...
Rishi Gupta, Piotr Indyk, Eric Price, Yaron Rachli...
WWW
2008
ACM
16 years 6 months ago
Web graph similarity for anomaly detection (poster)
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...
Panagiotis Papadimitriou 0002, Ali Dasdan, Hector ...
INFOCOM
2005
IEEE
15 years 11 months ago
New insights from a fixed point analysis of single cell IEEE 802.11 WLANs
— 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...
Anurag Kumar, Eitan Altman, Daniele Miorandi, Muni...
CORR
2007
Springer
104views Education» more  CORR 2007»
15 years 6 months ago
Sorting and Selection in Posets
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...
Constantinos Daskalakis, Richard M. Karp, Elchanan...