Sciweavers

1933 search results - page 267 / 387
» Improved Algorithms for the Feedback Vertex Set Problems
Sort
View
137
Voted
APPROX
2009
Springer
125views Algorithms» more  APPROX 2009»
15 years 10 months ago
Minimizing Average Shortest Path Distances via Shortcut Edge Addition
We consider adding k shortcut edges (i.e. edges of small fixed length δ ≥ 0) to a graph so as to minimize the weighted average shortest path distance over all pairs of vertices...
Adam Meyerson, Brian Tagiku
ICDM
2006
IEEE
108views Data Mining» more  ICDM 2006»
15 years 9 months ago
Integrating Features from Different Sources for Music Information Retrieval
Efficient and intelligent music information retrieval is a very important topic of the 21st century. With the ultimate goal of building personal music information retrieval syste...
Tao Li, Mitsunori Ogihara, Shenghuo Zhu
GECCO
2004
Springer
104views Optimization» more  GECCO 2004»
15 years 9 months ago
A Genetic Approach for Gene Selection on Microarray Expression Data
Abstract. Microarrays allow simultaneous measurement of the expression levels of thousands of genes in cells under different physiological or disease states. Because the number of...
Yong-Hyuk Kim, Su-Yeon Lee, Byung Ro Moon
LATA
2009
Springer
15 years 8 months ago
Nested Counters in Bit-Parallel String Matching
Many algorithms, e.g. in the field of string matching, are based on handling many counters, which can be performed in parallel, even on a sequential machine, using bit-parallelism...
Kimmo Fredriksson, Szymon Grabowski
ALDT
2009
Springer
126views Algorithms» more  ALDT 2009»
15 years 7 months ago
On Low-Envy Truthful Allocations
We study the problem of allocating a set of indivisible items to players having additive utility functions over the items. We consider allocations in which no player envies the bun...
Ioannis Caragiannis, Christos Kaklamanis, Panagiot...