379 search results - page 66 / 76 » The Graham-Knowlton Problem Revisited |
140
click to vote
FPGA
2010
ACM
16 years 21 days ago
2010
ACM
Placement based on simulated annealing is in dominant use in the FPGA community due to its superior quality of result (QoR). However, given the progression of FPGA device capacity...
113
Voted
CIKM
2009
Springer
15 years 10 months ago
2009
Springer
Many web links mislead human surfers and automated crawlers because they point to changed content, out-of-date information, or invalid URLs. It is a particular problem for large, ...
170
Voted
DAWAK
2007
Springer
15 years 10 months ago
2007
Springer
Several business applications such as marketing basket analysis, clickstream analysis, fraud detection and churning migration analysis demand gradient data analysis. By employing g...
136
click to vote
ESOP
2004
Springer
15 years 9 months ago
2004
Springer
t) Peter W. O’Hearn Queen Mary, University of London In the 1960s Dijkstra suggested that, in order to limit the complexity of potential process interactions, concurrent programs...
130
click to vote
COMPGEOM
2010
ACM
15 years 9 months ago
2010
ACM
We revisit one of the most fundamental classes of data structure problems in computational geometry: range searching. Back in SoCG’92, Matouˇsek gave a partition tree method fo...