1188 search results - page 85 / 238 » Extended Graph Unification |
ECCC
2006
15 years 25 days ago
2006
We show that for any > 0, a maximum-weight triangle in an undirected graph with n vertices and real weights assigned to vertices can be found in time O(n + n2+), where is the ...
117
click to vote
FSTTCS
2010
Springer
14 years 10 months ago
2010
Springer
This paper focuses on first-order logic (FO) extended by reachability predicates such that the expressiveness and hence decidability properties lie between FO and monadic second-o...
107
Voted
GLOBECOM
2009
IEEE
15 years 7 months ago
2009
IEEE
Abstract—In this paper, we consider the problem of multifunctional compression with side information. The problem is how we can compress a source X so that the receiver is able t...
118
Voted
CIKM
2006
Springer
15 years 4 months ago
2006
Springer
With ever growing competition in telecommunications markets, operators have to increasingly rely on business intelligence to offer the right incentives to their customers. Toward ...
107
Voted
INFOCOM
2009
IEEE
15 years 7 months ago
2009
IEEE
—Greedy routing is a novel routing paradigm where messages are always forwarded to the neighbor that is closest to the destination. Our main result is a polynomial-time algorithm...