1022 search results - page 84 / 205 » New models and algorithms for programmable networks |
111
Voted
INFOCOM
2009
IEEE
15 years 7 months ago
2009
IEEE
— Minimum-latency beaconing schedule (MLBS) in synchronous multihop wireless networks seeks a schedule for beaconing with the shortest latency. This problem is NP-hard even when ...
86
Voted
NIPS
2007
15 years 2 months ago
2007
We utilize the ensemble of trees framework, a tractable mixture over superexponential number of tree-structured distributions [1], to develop a new model for multivariate density ...
105
click to vote
INFOCOM
2011
IEEE
14 years 4 months ago
2011
IEEE
—This paper considers the problem of designing scheduling algorithms for multi-channel (e.g., OFDM-based) wireless downlink systems. We show that the Server-Side Greedy (SSG) rul...
93
Voted
AAAI
2008
15 years 3 months ago
2008
Automated generators for synthetic models and data can play a crucial role in designing new algorithms/modelframeworks, given the sparsity of benchmark models for empirical analys...
115
Voted
VISUALIZATION
2003
IEEE
15 years 6 months ago
2003
IEEE
We describe an efficient technique for out-of-core management and interactive rendering of planet sized textured terrain surfaces. The technique, called P-Batched Dynamic Adaptiv...