Sciweavers

11 search results - page 2 / 3
» Fractional Matching Via Balls-and-Bins
Sort
View
DC
2011
12 years 5 months ago
Distributed algorithms for covering, packing and maximum weighted matching
Abstract This paper gives poly-logarithmic-round, distributed δ-approximation algorithms for covering problems with submodular cost and monotone covering constraints (Submodular-c...
Christos Koufogiannakis, Neal E. Young
WWW
2006
ACM
14 years 6 months ago
Compressing and searching XML data via two zips
XML is fast becoming the standard format to store, exchange and publish over the web, and is getting embedded in applications. Two challenges in handling XML are its size (the XML...
Paolo Ferragina, Fabrizio Luccio, Giovanni Manzini...
KDD
2004
ACM
131views Data Mining» more  KDD 2004»
14 years 5 months ago
Fast nonlinear regression via eigenimages applied to galactic morphology
Astronomy increasingly faces the issue of massive datasets. For instance, the Sloan Digital Sky Survey (SDSS) has so far generated tens of millions of images of distant galaxies, ...
Brigham Anderson, Andrew W. Moore, Andrew Connolly...
VLDB
1999
ACM
118views Database» more  VLDB 1999»
13 years 9 months ago
Similarity Search in High Dimensions via Hashing
The nearest- or near-neighbor query problems arise in a large variety of database applications, usually in the context of similarity searching. Of late, there has been increasing ...
Aristides Gionis, Piotr Indyk, Rajeev Motwani
CIKM
2007
Springer
13 years 11 months ago
Just-in-time contextual advertising
Contextual Advertising is a type of Web advertising, which, given the URL of a Web page, aims to embed into the page (typically via JavaScript) the most relevant textual ads avail...
Aris Anagnostopoulos, Andrei Z. Broder, Evgeniy Ga...