Sciweavers

7150 search results - page 1045 / 1430
» An Approximation Algorithm for Approximation Rank
Sort
View
PVLDB
2008
174views more  PVLDB 2008»
15 years 6 months ago
Relaxation in text search using taxonomies
In this paper we propose a novel document retrieval model in which text queries are augmented with multi-dimensional taxonomy restrictions. These restrictions may be relaxed at a ...
Marcus Fontoura, Vanja Josifovski, Ravi Kumar, Chr...
JCO
2010
101views more  JCO 2010»
15 years 5 months ago
Separator-based data reduction for signed graph balancing
Abstract Polynomial-time data reduction is a classical approach to hard graph problems. Typically, particular small subgraphs are replaced by smaller gadgets. We generalize this ap...
Falk Hüffner, Nadja Betzler, Rolf Niedermeier
ICDM
2009
IEEE
181views Data Mining» more  ICDM 2009»
15 years 4 months ago
Efficient Discovery of Frequent Correlated Subgraph Pairs
The recent proliferation of graph data in a wide spectrum of applications has led to an increasing demand for advanced data analysis techniques. In view of this, many graph mining ...
Yiping Ke, James Cheng, Jeffrey Xu Yu
ICMLA
2009
15 years 4 months ago
Transformation Learning Via Kernel Alignment
This article proposes an algorithm to automatically learn useful transformations of data to improve accuracy in supervised classification tasks. These transformations take the for...
Andrew Howard, Tony Jebara
ANOR
2010
130views more  ANOR 2010»
15 years 4 months ago
Greedy scheduling with custom-made objectives
We present a methodology to automatically generate an online job scheduling method for a custom-made objective and real workloads. The scheduling problem comprises independent para...
Carsten Franke, Joachim Lepping, Uwe Schwiegelshoh...
« Prev « First page 1045 / 1430 Last » Next »