Sciweavers

1404 search results - page 38 / 281
» Optimization problems in multiple-interval graphs
Sort
View
TAMC
2009
Springer
15 years 4 months ago
Approximation and Hardness Results for Label Cut and Related Problems
We investigate a natural combinatorial optimization problem called the Label Cut problem. Given an input graph G with a source s and a sink t, the edges of G are classified into ...
Peng Zhang, Jin-yi Cai, Linqing Tang, Wenbo Zhao
95
Voted
ICDM
2010
IEEE
228views Data Mining» more  ICDM 2010»
14 years 7 months ago
Multi-label Feature Selection for Graph Classification
Nowadays, the classification of graph data has become an important and active research topic in the last decade, which has a wide variety of real world applications, e.g. drug acti...
Xiangnan Kong, Philip S. Yu
IPPS
2002
IEEE
15 years 2 months ago
Optimizing Graph Algorithms for Improved Cache Performance
Tiling has long been used to improve cache performance. Recursion has recently been used as a cache-oblivious method of improving cache performance. Both of these techniques are n...
Joon-Sang Park, Michael Penner, Viktor K. Prasanna
ESA
2011
Springer
231views Algorithms» more  ESA 2011»
13 years 9 months ago
Distribution-Aware Compressed Full-Text Indexes
Abstract. In this paper we address the problem of building a compressed self-index that, given a distribution for the pattern queries and a bound on the space occupancy, minimizes ...
Paolo Ferragina, Jouni Sirén, Rossano Ventu...
SODA
2008
ACM
127views Algorithms» more  SODA 2008»
14 years 11 months ago
Nondecreasing paths in a weighted graph or: how to optimally read a train schedule
A travel booking office has timetables giving arrival and departure times for all scheduled trains, including their origins and destinations. A customer presents a starting city a...
Virginia Vassilevska