Sciweavers

6251 search results - page 904 / 1251
» Randomness, Computability, and Density
Sort
View
ICS
2007
Tsinghua U.
16 years 1 months ago
Locality of sampling and diversity in parallel system workloads
Observing the workload on a computer system during a short (but not too short) time interval may lead to distributions that are significantly different from those that would be o...
Dror G. Feitelson
STACS
2007
Springer
16 years 1 months ago
The Polynomially Bounded Perfect Matching Problem Is in NC 2
Abstract. The perfect matching problem is known to be in ¶, in randomized NC, and it is hard for NL. Whether the perfect matching problem is in NC is one of the most prominent ope...
Manindra Agrawal, Thanh Minh Hoang, Thomas Thierau...
WAW
2007
Springer
144views Algorithms» more  WAW 2007»
16 years 1 months ago
Approximating Betweenness Centrality
Betweenness is a centrality measure based on shortest paths, widely used in complex network analysis. It is computationally-expensive to exactly determine betweenness; currently th...
David A. Bader, Shiva Kintali, Kamesh Madduri, Mil...
ICPP
2006
IEEE
16 years 1 months ago
Parallel Information Extraction on Shared Memory Multi-processor System
Text Mining is one of the best solutions for today and the future’s information explosion. With the development of modern processor technologies, it will be a mass market deskto...
Jiulong Shan, Yurong Chen, Qian Diao, Yimin Zhang
IPPS
2006
IEEE
16 years 1 months ago
Non-cooperative, semi-cooperative, and cooperative games-based grid resource allocation
In this paper we consider, compare and analyze three game theoretical Grid resource allocation mechanisms. Namely, 1) the non-cooperative sealed-bid method where tasks are auction...
Samee Ullah Khan, Ishfaq Ahmad