Sciweavers

4315 search results - page 812 / 863
» Sorting in linear time
Sort
View
WSDM
2009
ACM
191views Data Mining» more  WSDM 2009»
14 years 3 months ago
Generating labels from clicks
The ranking function used by search engines to order results is learned from labeled training data. Each training point is a (query, URL) pair that is labeled by a human judge who...
Rakesh Agrawal, Alan Halverson, Krishnaram Kenthap...
HIPEAC
2009
Springer
14 years 3 months ago
Adapting Application Mapping to Systematic Within-Die Process Variations on Chip Multiprocessors
Process variations, which lead to timing and power variations across identically-designed components, have been identified as one of the key future design challenges by the semico...
Yang Ding, Mahmut T. Kandemir, Mary Jane Irwin, Pa...
ICSE
2009
IEEE-ACM
14 years 3 months ago
MINTS: A general framework and tool for supporting test-suite minimization
Regression test suites tend to grow over time as new test cases are added to exercise new functionality or to target newly-discovered faults. When test suites become too large, th...
Hwa-You Hsu, Alessandro Orso
ISBRA
2009
Springer
14 years 3 months ago
Untangling Tanglegrams: Comparing Trees by Their Drawings
A tanglegram is a pair of trees on the same set of leaves with matching leaves in the two trees joined by an edge. Tanglegrams are widely used in biology – to compare evolutiona...
Balaji Venkatachalam, Jim Apple, Katherine St. Joh...
LATA
2009
Springer
14 years 3 months ago
Monadic Second-Order Logic for Graphs: Algorithmic and Language Theoretical Applications
This tutorial will present an overview of the use of Monadic Second-Order Logic to describe sets of finite graphs and graph transformations, in relation with the notions of tree-w...
Bruno Courcelle