Sciweavers

1408 search results - page 211 / 282
» Dynamical Tensor Approximation
Sort
View
VLSID
2002
IEEE
127views VLSI» more  VLSID 2002»
15 years 10 months ago
Switching Activity Estimation of Large Circuits using Multiple Bayesian Networks
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...
Sanjukta Bhanja, N. Ranganathan
RECOMB
2005
Springer
15 years 10 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...
OSDI
2004
ACM
15 years 10 months ago
Deploying Safe User-Level Network Services with icTCP
We present icTCP, an "information and control" TCP implementation that exposes key pieces of internal TCP state and allows certain TCP variables to be set in a safe fash...
Haryadi S. Gunawi, Andrea C. Arpaci-Dusseau, Remzi...
VLDB
2007
ACM
191views Database» more  VLDB 2007»
15 years 10 months ago
Multidimensional reverse k NN search
Given a multidimensional point q, a reverse k nearest neighbor (RkNN) query retrieves all the data points that have q as one of their k nearest neighbors. Existing methods for proc...
Yufei Tao, Dimitris Papadias, Xiang Lian, Xiaokui ...
SODA
2010
ACM
202views Algorithms» more  SODA 2010»
15 years 7 months ago
Counting Inversions, Offline Orthogonal Range Counting, and Related Problems
We give an O(n lg n)-time algorithm for counting the number of inversions in a permutation on n elements. This improves a long-standing previous bound of O(n lg n/ lg lg n) that ...
Timothy M. Chan, Mihai Patrascu