2252 search results - page 203 / 451 » Lower Bounds for Dynamic Algorithms |
143
Voted
IPPS
1999
IEEE
15 years 8 months ago
1999
IEEE
All-to-all broadcast scheduling problems are considered in WDM optical passive star networks where k wavelengths are available in the network. It is assumed that each node has exac...
113
Voted
PAMI
2002
15 years 3 months ago
2002
In this article, we evaluate the performance of three clustering algorithms, hard K-Means, single linkage, and a simulated annealing (SA) based technique, in conjunction with four ...
111
Voted
ICPR
2008
IEEE
16 years 4 months ago
2008
IEEE
Many studies have now shown that it is possible to recognize people by the way they walk. As yet there has been little formal study of people recognition using the kinematic-relat...
145
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
The problem of distributed learning and channel access is considered in a cognitive network with multiple secondary users. The availability statistics of the channels are initially...
136
Voted
ANOR
2011
14 years 7 months ago
2011
The challenge of maximizing the diversity of a collection of points arises in a variety of settings, including the setting of search methods for hard optimization problems. One ver...