2252 search results - page 286 / 451 » Lower Bounds for Dynamic Algorithms |
147
Voted
INFOCOM
1998
IEEE
15 years 7 months ago
1998
IEEE
We consider the problem of constructing logical topologies over a wavelength-routed optical network with no wavelength changers. We present a general linear formulation which consi...
133
click to vote
COLT
2010
Springer
15 years 1 months ago
2010
Springer
In recent years analysis of complexity of learning Gaussian mixture models from sampled data has received significant attention in computational machine learning and theory commun...
137
Voted
SIGMETRICS
2008
ACM
15 years 3 months ago
2008
ACM
Dynamic networks are those where the topology changes over time and therefore efficient routes need to be maintained by frequent updates. Such updates could be costly in terms of ...
126
Voted
SAC
2004
ACM
15 years 9 months ago
2004
ACM
The amount of data handled by real-time and embedded applications is increasing. Also, applications normally have constraints with respect to freshness and timeliness of the data ...
139
Voted
AI
1999
Springer
15 years 3 months ago
1999
Springer
Bucket elimination is an algorithmic framework that generalizes dynamic programming to accommodate many problem-solving and reasoning tasks. Algorithms such as directional-resolut...