1326 search results - page 234 / 266 » Approximate Tree Kernels |
108
click to vote
VLSID
2002
IEEE
16 years 2 months ago
2002
IEEE
Switching activity estimation is a crucial step in estimating dynamic power consumption in CMOS circuits. In [1], we proposed a new switching probability model based on Bayesian N...
102
click to vote
RECOMB
2006
Springer
16 years 2 months ago
2006
Springer
Micro-indels are small insertion or deletion events (indels) that occur during genome evolution. The study of micro-indels is important, both in order to better understand the unde...
115
click to vote
RECOMB
2005
Springer
16 years 2 months ago
2005
Springer
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...
107
click to vote
STOC
2001
ACM
16 years 2 months ago
2001
ACM
We show that we can maintain up to polylogarithmic edge connectivity for a fully-dynamic graph in ~O(pn) time per edge insertion or deletion. Within logarithmic factors, this matc...
217
click to vote
VLDB
2007
ACM
16 years 2 months ago
2007
ACM
We present STAR, a self-tuning algorithm that adaptively sets numeric precision constraints to accurately and efficiently answer continuous aggregate queries over distributed data...