3267 search results - page 265 / 654 » Generalized quasirandom graphs |
169
click to vote
COMGEO
2004
ACM
15 years 6 months ago
2004
ACM
We introduce a novel technique for drawing proximity graphs in polynomial area and volume. Previously known algorithms produce representations whose size increases exponentially w...
181
click to vote
FUIN
2000
15 years 6 months ago
2000
We consider the problem of dependable computation with multiple inputs. The goal is to study when redundancy can help to achieve survivability and when it cannot. We use AND/OR gra...
218
Voted
WWW
2008
ACM
16 years 7 months ago
2008
ACM
Automatic topic discovery and tracking on web-shared videos can greatly benefit both web service providers and end users. Most of current solutions of topic detection and tracking...
153
click to vote
DCC
2007
IEEE
16 years 6 months ago
2007
IEEE
We consider the distributed computation of a function of random sources with minimal communication. Specifically, given two discrete memoryless sources, X and Y , a receiver wishe...
202
Voted
CCS
2009
ACM
16 years 1 months ago
2009
ACM
A major challenge of the anti-virus (AV) industry is how to effectively process the huge influx of malware samples they receive every day. One possible solution to this problem i...