1538 search results - page 162 / 308 » Spectral Techniques in Graph Algorithms |
165
click to vote
INFOCOM
2010
IEEE
15 years 2 months ago
2010
IEEE
—In this paper we consider the problem of maximizing wireless network capacity (a.k.a. one-shot scheduling) in both the protocol and physical models. We give the first distribut...
128
click to vote
VLDB
2005
ACM
15 years 9 months ago
2005
ACM
Relational, XML and HTML data can be represented as graphs with entities as nodes and relationships as edges. Text is associated with nodes and possibly edges. Keyword search on s...
120
click to vote
CIKM
2003
Springer
15 years 9 months ago
2003
Springer
Traffic analysis, in the context of Telecommunications or Internet and Web data, is crucial for large network operations. Data in such networks is often provided as large graphs w...
133
Voted
FLAIRS
2004
15 years 5 months ago
2004
In the recent years, CSP's have come to be seen as the core problem in many applications. We propose here a hybrid algorithm (MC-FC) that combines two different search method...
158
click to vote
ALGORITHMICA
2006
15 years 4 months ago
2006
We provide combinatorial algorithms for the unsplittable flow problem (UFP) that either match or improve the previously best results. In the UFP we are given a (possibly directed)...