Sciweavers

2376 search results - page 212 / 476
» More Efficient Internal-Regret-Minimizing Algorithms
Sort
View
88
Voted
DAC
2008
ACM
16 years 4 months ago
Topological routing to maximize routability for package substrate
Compared with on-chip routers, the existing commercial tools for off-chip routing have a much lower routability and often result in a large number of unrouted nets for manual rout...
Shenghua Liu, Guoqiang Chen, Tom Tong Jing, Lei He...
147
Voted
ICML
2006
IEEE
16 years 4 months ago
The relationship between Precision-Recall and ROC curves
Receiver Operator Characteristic (ROC) curves are commonly used to present results for binary decision problems in machine learning. However, when dealing with highly skewed datas...
Jesse Davis, Mark Goadrich
215
Voted
POPL
2005
ACM
16 years 4 months ago
Region-based shape analysis with tracked locations
This paper proposes a novel approach to shape analysis: using local reasoning about individual heap locations of global reasoning about entire heap abstractions. We present an int...
Brian Hackett, Radu Rugina
134
Voted
RECOMB
2005
Springer
16 years 4 months ago
Lower Bounds for Maximum Parsimony with Gene Order Data
Abstract. In this paper, we study lower bound techniques for branchand-bound algorithms for maximum parsimony, with a focus on gene order data. We give a simple O(n3 ) time dynamic...
Abraham Bachrach, Kevin Chen, Chris Harrelson, Rad...
194
Voted
SIGMOD
2009
ACM
134views Database» more  SIGMOD 2009»
16 years 3 months ago
Extending autocompletion to tolerate errors
Autocompletion is a useful feature when a user is doing a look up from a table of records. With every letter being typed, autocompletion displays strings that are present in the t...
Surajit Chaudhuri, Raghav Kaushik