463 search results - page 47 / 93 » A General Framework for Graph Sparsification |
259
click to vote
ICDE
2009
IEEE
16 years 5 months ago
2009
IEEE
Due to its considerable ease of use, relational keyword search (R-KWS) has become increasingly popular. Its simplicity, however, comes at the cost of intensive query processing. Sp...
145
click to vote
ISPD
2010
ACM
15 years 10 months ago
2010
ACM
Double Patterning Lithography (DPL) is one of the few hopeful candidate solutions for the lithography for CMOS process beyond 45nm. DPL assigns the patterns less than a certain di...
136
Voted
STOC
2004
ACM
16 years 3 months ago
2004
ACM
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
135
Voted
CDC
2009
IEEE
15 years 7 months ago
2009
IEEE
Distributed decision making in networked systems depends critically on the timely availability of critical fresh information. Performance of networked systems, from the perspective...
143
Voted
WSDM
2009
ACM
15 years 10 months ago
2009
ACM
Recently the re-ranking algorithms have been quite popular for web search and data mining. However, one of the issues is that those algorithms treat the content and link informati...