7006 search results - page 1064 / 1402 » Approximation Algorithms |
175
Voted
STOC
2007
ACM
16 years 7 months ago
2007
ACM
Given as input a directed graph on N vertices and a set of source-destination pairs, we study the problem of routing the maximum possible number of source-destination pairs on pat...
194
click to vote
ICML
2009
IEEE
16 years 7 months ago
2009
IEEE
This paper investigates a new learning formulation called structured sparsity, which is a naturalextensionofthestandardsparsityconceptinstatisticallearningandcompressivesensing. B...
207
click to vote
BROADNETS
2007
IEEE
16 years 1 months ago
2007
IEEE
— In this paper we deal with online broadcasting and multicasting in a WDM optical network with shared light splitter bank. Our objective is to maximize the network throughput. S...
154
click to vote
SEMWEB
2007
Springer
16 years 24 days ago
2007
Springer
Abstract The most common matching applications, e.g., ontology matching, focus on the computation of the correspondences holding between the nodes of graph structures (e.g., concep...
182
click to vote
DMIN
2006
15 years 8 months ago
2006
Discovering hidden patterns in large sets of workforce schedules to gain insight into the potential knowledge in workforce schedules are crucial to better understanding the workfor...