144 search results - page 16 / 29 » Sampling Techniques for Large, Dynamic Graphs |
83
Voted
ICCAD
2007
IEEE
15 years 9 months ago
2007
IEEE
— We present a new linear time technique to compute criticality information in a timing graph by dividing it into “zones”. Errors in using tightness probabilities for critica...
119
Voted
NAACL
2010
14 years 10 months ago
2010
We present a random-walk-based approach to learning paraphrases from bilingual parallel corpora. The corpora are represented as a graph in which a node corresponds to a phrase, an...
141
click to vote
CVPR
2011
IEEE
14 years 10 months ago
2011
IEEE
Active learning techniques have gained popularity in reducing human effort to annotate data instances for inducing a classifier. When faced with large quantities of unlabeled dat...
111
Voted
NDSS
2009
IEEE
15 years 7 months ago
2009
IEEE
Anti-malware companies receive thousands of malware samples every day. To process this large quantity, a number of automated analysis tools were developed. These tools execute a m...
120
click to vote
MICRO
2009
IEEE
15 years 7 months ago
2009
IEEE
Data structures define how values being computed are stored and accessed within programs. By recognizing what data structures are being used in an application, tools can make app...