1951 search results - page 356 / 391 » An algorithm for improving graph partitions |
CIKM
2009
Springer
15 years 4 months ago
2009
Springer
One of the most important steps in web crawling is determining the starting points, or seed selection. This paper identifies and explores the problem of seed selection in webscal...
INFOCOM
2007
IEEE
15 years 4 months ago
2007
IEEE
— A wide range of applications for wireless ad hoc networks are time-critical and impose stringent requirement on the communication latency. This paper studies the problem Minimu...
APPT
2007
Springer
15 years 4 months ago
2007
Springer
It is a great challenge to map network processing tasks to processing resources of advanced network processors, which are heterogeneous and multi-threading multiprocessor System-on...
ESTIMEDIA
2007
Springer
15 years 4 months ago
2007
Springer
Today’s embedded applications often consist of multiple concurrent tasks. These tasks are decomposed into subtasks which are in turn assigned and scheduled on multiple different...
ICALP
2007
Springer
15 years 4 months ago
2007
Springer
Register allocation is NP-complete in general but can be solved in linear time for straight-line programs where each variable has at most one definition point if the bank of regis...