2432 search results - page 463 / 487 » Degrees and choice numbers |
116
click to vote
ICALP
1992
Springer
15 years 6 months ago
1992
Springer
Suppose that n tokens are arbitrarily placed on the n nodes of a graph. At each parallel step one token may be moved from each node to an adjacent node. An algorithm for the near-...
141
click to vote
CASES
2007
ACM
2007
ACM
INTACTE: an interconnect area, delay, and energy estimation tool for microarchitectural explorations
15 years 5 months ago
Prior work on modeling interconnects has focused on optimizing the wire and repeater design for trading off energy and delay, and is largely based on low level circuit parameters....
97
Voted
PET
2010
Springer
15 years 5 months ago
2010
Springer
We investigate the degree to which modern web browsers are subject to “device fingerprinting” via the version and configuration information that they will transmit to website...
116
click to vote
CIDM
2009
IEEE
15 years 5 months ago
2009
IEEE
The graph classification problem is learning to classify separate, individual graphs in a graph database into two or more categories. A number of algorithms have been introduced fo...
106
click to vote
DOCENG
2007
ACM
15 years 5 months ago
2007
ACM
Variable Data Printing (VDP) has brought new flexibility and dynamism to the printed page. Each printed instance of a specific class of document can now have different degrees of ...