1487 search results - page 41 / 298 » The Computational Complexity of Link Building |
EDCC
2010
Springer
14 years 1 months ago
2010
Springer
Distributed Hash Tables (DHTs) and Random Peer Sampling (RPS) provide important and complementary services in the area of P2P overlay networks. DHTs achieve efficient lookup whil...
IANDC
2011
13 years 3 months ago
2011
Abstract. Gene trees are leaf-labeled trees inferred from molecular sequences. Due to duplication events arising in genome evolution, gene trees usually have multiple copies of som...
IEEEPACT
2005
IEEE
14 years 2 months ago
2005
IEEE
Current integration trends embrace the prosperity of single-chip multi-core processors. Although multi-core processors deliver significantly improved system throughput, single-thr...
VLSID
2006
IEEE
14 years 8 months ago
2006
IEEE
Serial links in network on chip provide advantages in terms of reduced wiring area, reduced switch complexity and power. However, serial links offer lower bandwidth in comparison ...
JC
2008
13 years 8 months ago
2008
Valiant introduced 20 years ago an algebraic complexity theory to study the complexity of polynomial families. The basic computation model used is the arithmetic circuit, which ma...