5105 search results - page 13 / 1021 » An algorithm to determine peer-reviewers |
147
click to vote
ESA
2010
Springer
15 years 7 months ago
2010
Springer
In this paper, we show that for an n-vertex graph G of genus g, the edge expansion of G can be determined in time nO(g2 ) . We show that the same is true for various other similar ...
145
click to vote
APN
2005
Springer
15 years 11 months ago
2005
Springer
STGs give a formalism for the description of asynchronous circuits based on Petri nets. To overcome the state explosion problem one may encounter during circuit synthesis, a nondet...
149
click to vote
CGF
1998
15 years 5 months ago
1998
In this paper, we present an e cient algorithm for contact determination between spline models. We make use of a new hierarchy, called ShellTree, that comprises of spherical shell...
155
click to vote
MIDDLEWARE
2007
Springer
16 years 3 days ago
2007
Springer
Abstract. Epidemic protocols have demonstrated remarkable scalability and robustness in disseminating information on internet-scale, dynamic P2P systems. However, popular instances...
181
click to vote
ICMAS
2000
15 years 7 months ago
2000
Combinatorial auctions are important as they enable bidders to place bids on combinations of items; compared to other auction mechanisms, they often increase the efficiency of the...