2004 search results - page 41 / 401 » Sampling from large graphs |
MICRO
2010
IEEE
14 years 9 months ago
2010
IEEE
Last-level caches (LLCs) are large structures with significant power requirements. They can be quite inefficient. On average, a cache block in a 2MB LRU-managed LLC is dead 86% of ...
ICIP
2006
IEEE
15 years 5 months ago
2006
IEEE
Compressive sampling (CS), or “Compressed Sensing,” has recently generated a tremendous amount of excitement in the image processing community. CS involves taking a relatively...
114
click to vote
KDD
2004
ACM
16 years 5 days ago
2004
ACM
One fundamental challenge for mining recurring subgraphs from semi-structured data sets is the overwhelming abundance of such patterns. In large graph databases, the total number ...
112
click to vote
GECCO
2008
Springer
15 years 26 days ago
2008
Springer
The key ideas behind most of the recently proposed Markov networks based EDAs were to factorise the joint probability distribution in terms of the cliques in the undirected graph....
INFOCOM
2006
IEEE
15 years 5 months ago
2006
IEEE
— Monitoring the traffic in high-speed networks is a data intensive problem. Uniform packet sampling is the most popular technique for reducing the amount of data the network mo...