2137 search results - page 417 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
137
click to vote
FOCS
2002
IEEE
15 years 6 months ago
2002
IEEE
In recent years, gossip-based algorithms have gained prominence as a methodology for designing robust and scalable communication schemes in large distributed systems. The premise ...
102
click to vote
ICALP
2010
Springer
15 years 6 months ago
2010
Springer
The placement of regenerators in optical networks has become an active area of research during the last years. Given a set of lightpaths in a network G and a positive integer d, re...
120
click to vote
COMPGEOM
2006
ACM
15 years 7 months ago
2006
ACM
In a Batched Colored Intersection Searching Problem (CI), one is given a set of n geometric objects (of a certain class). Each object is colored by one of c colors, and the goal i...
142
Voted
INFOCOM
2007
IEEE
15 years 8 months ago
2007
IEEE
— Scalable and efficient routing is a main challenge in the deployment of large ad hoc wireless networks. An essential element of practical routing protocols is their accommodat...
129
Voted
KDD
2010
ACM
15 years 5 months ago
2010
ACM
Many recommendation and retrieval tasks can be represented as proximity queries on a labeled directed graph, with typed nodes representing documents, terms, and metadata, and labe...