5100 search results - page 784 / 1020 » The Linear Complexity of a Graph |
165
click to vote
CIKM
2007
Springer
16 years 19 days ago
2007
Springer
Visualizing network data, from tree structures to arbitrarily connected graphs, is a difficult problem in information visualization. A large part of the problem is that in network...
196
click to vote
ICPP
2006
IEEE
16 years 15 days ago
2006
IEEE
This paper discusses fast parallel algorithms for evaluating several centrality indices frequently used in complex network analysis. These algorithms have been optimized to exploi...
158
click to vote
RTCSA
2006
IEEE
16 years 14 days ago
2006
IEEE
ILP (Instruction Level Parallelism) processors are being increasingly used in embedded systems. In embedded systems, instructions may be subject to timing constraints. An optimisi...
147
click to vote
SIGECOM
2006
ACM
16 years 13 days ago
2006
ACM
We present approximation and online algorithms for a number of problems of pricing items for sale so as to maximize seller’s revenue in an unlimited supply setting. Our first r...
184
click to vote
SPAA
2006
ACM
16 years 12 days ago
2006
ACM
One of the fundamental trade-offs in compact routing schemes is between the space used to store the routing table on each node and the stretch factor of the routing scheme – th...