Sciweavers

423 search results - page 36 / 85
» Topology for Distributed Inference on Graphs
Sort
View
INFOCOM
2005
IEEE
15 years 5 months ago
Link scheduling in sensor networks: distributed edge coloring revisited
— We consider the problem of link scheduling in a sensor network employing a TDMA MAC protocol. Our link scheduling algorithm involves two phases. In the first phase, we assign ...
Shashidhar Gandham, Milind Dawande, Ravi Prakash
GD
2008
Springer
15 years 28 days ago
Dunnart: A Constraint-Based Network Diagram Authoring Tool
We present a new network diagram authoring tool, Dunnart, that provides continuous network layout. It continuously adjusts the layout in response to user interaction, while still m...
Tim Dwyer, Kim Marriott, Michael Wybrow
ACL
2008
15 years 1 months ago
Integrating Graph-Based and Transition-Based Dependency Parsers
Previous studies of data-driven dependency parsing have shown that the distribution of parsing errors are correlated with theoretical properties of the models used for learning an...
Joakim Nivre, Ryan T. McDonald
CORR
2011
Springer
188views Education» more  CORR 2011»
14 years 6 months ago
Towards Unbiased BFS Sampling
Abstract—Breadth First Search (BFS) is a widely used approach for sampling large unknown Internet topologies. Its main advantage over random walks and other exploration technique...
Maciej Kurant, Athina Markopoulou, Patrick Thiran
CORR
2010
Springer
160views Education» more  CORR 2010»
14 years 12 months ago
Scalable Probabilistic Databases with Factor Graphs and MCMC
Incorporating probabilities into the semantics of incomplete databases has posed many challenges, forcing systems to sacrifice modeling power, scalability, or treatment of relatio...
Michael L. Wick, Andrew McCallum, Gerome Miklau