Sciweavers

957 search results - page 184 / 192
» A Probability Model for Combining Ranks
Sort
View
STOC
1997
ACM
91views Algorithms» more  STOC 1997»
15 years 3 months ago
Lower Bounds for Distributed Coin-Flipping and Randomized Consensus
We examine a class of collective coin- ipping games that arises from randomized distributed algorithms with halting failures. In these games, a sequence of local coin ips is gener...
James Aspnes
EXPCS
2007
15 years 1 months ago
Pipeline spectroscopy
Pipeline Spectroscopy is a new technique that allows us to measure the cost of each cache miss. The cost of a miss is displayed (graphed) as a histogram, which represents a precis...
Thomas R. Puzak, Allan Hartstein, Philip G. Emma, ...
AI
2002
Springer
14 years 11 months ago
Improving heuristic mini-max search by supervised learning
This article surveys three techniques for enhancing heuristic game-tree search pioneered in the author's Othello program Logistello, which dominated the computer Othello scen...
Michael Buro
BMCBI
2004
115views more  BMCBI 2004»
14 years 11 months ago
Quantifying the relationship between co-expression, co-regulation and gene function
Background: It is thought that genes with similar patterns of mRNA expression and genes with similar functions are likely to be regulated via the same mechanisms. It has been diff...
Dominic J. Allocco, Isaac S. Kohane, Atul J. Butte
CVPR
2003
IEEE
16 years 1 months ago
Face Recognition Under Variable Lighting using Harmonic Image Exemplars
We propose a new approach for face recognition under arbitrary illumination conditions, which requires only one training image per subject (if there is no pose variation) and no 3...
Lei Zhang 0002, Dimitris Samaras