1090 search results - page 141 / 218 » Priority Algorithms for Graph Optimization Problems |
VLDB
2008
ACM
14 years 8 months ago
2008
ACM
Several variations of nearest neighbor (NN) query have been investigated by the database community. However, realworld applications often result in the formulation of new variatio...
ICCAD
2009
IEEE
13 years 5 months ago
2009
IEEE
With increasing process variation, binning has become an important technique to improve the values of fabricated chips, especially in high performance microprocessors where transpa...
ICCS
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. In knowledge bases, the open world assumption and the ability to express variables may lead to an answer redundancy problem. This problem occurs when the returned answers...
STOC
2004
ACM
14 years 8 months ago
2004
ACM
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
IPPS
1998
IEEE
13 years 12 months ago
1998
IEEE
This paper shows the power of randomization in designing e cient parallel algorithms for the problems of routing and PRAM emulation. We show that with randomization techniques opti...