Sciweavers

227 search results - page 30 / 46
» Deterministic Sampling Algorithms for Network Design
Sort
View
ICASSP
2011
IEEE
14 years 4 months ago
Content preference estimation in online social networks: Message passing versus sparse reconstruction on graphs
We design two different strategies for computing the unknown content preferences in an online social network based on a small set of nodes in the corresponding social graph for wh...
Jacob Chakareski
WSC
2004
15 years 1 months ago
A Scenario Generation Tool for DDF Simulation Testbeds
An interactive tool has been developed for visualizing and creating scaled battlefield based scenarios for use in a simulation testbed to develop and test distributed data fusion ...
Govindarajan Srimathveeravalli, Navneeth Subramani...
102
Voted
CORR
2010
Springer
130views Education» more  CORR 2010»
14 years 9 months ago
Oblivious Buy-at-Bulk in Planar Graphs
In the oblivious buy-at-bulk network design problem in a graph, the task is to compute a fixed set of paths for every pair of source-destination in the graph, such that any set of ...
Srinivasagopalan Srivathsan, Costas Busch, S. Sith...
ICDCSW
2011
IEEE
14 years 1 days ago
Link-Level Network Topology Generation
Abstract—Internet topology generation involves producing synthetic network topologies that imitate the characteristics of the Internet. Although the accuracy of newly developed n...
Mehmet Burak Akgun, Mehmet Hadi Gunes
107
Voted
WCNC
2008
IEEE
15 years 6 months ago
Estimation of Link Quality and Residual Time in Vehicular Ad Hoc Networks
—High node mobility and transient connectivity in Vehicular Ad Hoc NETworks have introduced numerous challenges in the design of efficient communication protocols for these netwo...
Nikoletta Sofra, Kin K. Leung