4114 search results - page 403 / 823 » Efficient Algorithms for the 2-Center Problems |
176
click to vote
ICML
2010
IEEE
15 years 8 months ago
2010
IEEE
Approximate MAP inference in graphical models is an important and challenging problem for many domains including computer vision, computational biology and natural language unders...
181
click to vote
JSAC
2006
15 years 6 months ago
2006
We use game theorectic models to show the lack of incentives in the TCP congestion avoidance algorithm and the consequential systemwide network problems. We then propose a Vickery-...
207
click to vote
JSAC
2008
15 years 6 months ago
2008
In this paper, we study the theoretical problem of the end-to-end rate assignment for multi-hop wireless networks. Specifically, we consider the problem of joint congestion control...
196
click to vote
IPPS
1998
IEEE
15 years 11 months ago
1998
IEEE
In this paper the problem of fault-tolerant message routing in two-dimensional meshes, with each inner node having 4 neighbors, is investigated. It is assumed that some nodes/links...
299
click to vote
ICDE
2007
IEEE
16 years 8 months ago
2007
IEEE
This paper investigates the view update problem for XML views published from relational data. We consider (possibly) recursively defined XML views, compressed into DAGs and stored...