Sciweavers

1090 search results - page 182 / 218
» Priority Algorithms for Graph Optimization Problems
Sort
View
CORR
2010
Springer
126views Education» more  CORR 2010»
13 years 7 months ago
Towards Providing Low-Risk and Economically Feasible Network Data Transfer Services
: - In the first part of this paper we present the first steps towards providing low-risk and economically feasible network data transfer services. We introduce three types of data...
Mugurel Ionut Andreica, Vasile Deac, Stelian Tipa
EMNLP
2010
13 years 5 months ago
Turbo Parsers: Dependency Parsing by Approximate Variational Inference
We present a unified view of two state-of-theart non-projective dependency parsers, both approximate: the loopy belief propagation parser of Smith and Eisner (2008) and the relaxe...
André F. T. Martins, Noah A. Smith, Eric P....
EDBT
2012
ACM
228views Database» more  EDBT 2012»
11 years 10 months ago
Towards scalable data integration under constraints
In this paper we consider the problem of answering queries using views, with or without ontological constraints, which is important for data integration, query optimization, and d...
George Konstantinidis, José Luis Ambite
CORR
2008
Springer
150views Education» more  CORR 2008»
13 years 7 months ago
Message-passing for Maximum Weight Independent Set
Abstract--In this paper, we investigate the use of messagepassing algorithms for the problem of finding the max-weight independent set (MWIS) in a graph. First, we study the perfor...
Sujay Sanghavi, Devavrat Shah, Alan S. Willsky
INFOCOM
2008
IEEE
14 years 2 months ago
Feasible Rate Allocation in Wireless Networks
—Rate allocation is a fundamental problem in the operation of a wireless network because of the necessity to schedule the operation of mutually interfering links between the node...
Ramakrishna Gummadi, Kyomin Jung, Devavrat Shah, R...