Sciweavers

923 search results - page 153 / 185
» Factorizing Languages
Sort
View
ICALP
2009
Springer
16 years 3 days ago
Correlation Clustering Revisited: The "True" Cost of Error Minimization Problems
Correlation Clustering was defined by Bansal, Blum, and Chawla as the problem of clustering a set of elements based on a possibly inconsistent binary similarity function between e...
Nir Ailon, Edo Liberty
ICALP
2009
Springer
16 years 3 days ago
Improved Algorithms for Latency Minimization in Wireless Networks
In the interference scheduling problem, one is given a set of n communication requests described by sourcedestination pairs of nodes from a metric space. The nodes correspond to d...
Alexander Fanghänel, Berthold Vöcking, T...
ICALP
2009
Springer
16 years 3 days ago
Maximum Bipartite Flow in Networks with Adaptive Channel Width
Traditionally, combinatorial optimization problems (such as maximum flow, maximum matching, etc.) have been studied for networks where each link has a fixed capacity. Recent resear...
Yossi Azar, Aleksander Madry, Thomas Moscibroda, D...
ICALP
2005
Springer
15 years 5 months ago
Approximation Algorithms for the Max-coloring Problem
Given a graph G = (V, E) and positive integral vertex weights w : V → N, the max-coloring problem seeks to find a proper vertex coloring of G whose color classes C1, C2, . . . ,...
Sriram V. Pemmaraju, Rajiv Raman
EDBT
2009
ACM
133views Database» more  EDBT 2009»
15 years 4 months ago
Schema-conscious filtering of XML documents
In a publish-subscribe system based on filtering of XML documents, subscribers specify their interests with profiles expressed in the XPath language. The system processes a stre...
Panu Silvasti, Seppo Sippu, Eljas Soisalon-Soinine...