Sciweavers

2254 search results - page 38 / 451
» Computing the minimal covering set
Sort
View
DAC
1995
ACM
14 years 1 months ago
Register Allocation and Binding for Low Power
This paper describes a technique for calculating the switching activity of a set of registers shared by di erent data values. Based on the assumption that the joint pdf (probabili...
Jui-Ming Chang, Massoud Pedram
PVLDB
2008
123views more  PVLDB 2008»
13 years 9 months ago
Propagating functional dependencies with conditions
The dependency propagation problem is to determine, given a view defined on data sources and a set of dependencies on the sources, whether another dependency is guaranteed to hold...
Wenfei Fan, Shuai Ma, Yanli Hu, Jie Liu, Yinghui W...
MICCAI
2005
Springer
14 years 10 months ago
Optimal Trajectories Computation Within Regions of Interest for Hepatic RFA Planning
Abstract. Percutaneous radiofrequency ablation has become a frequently used technique for the treatment of liver cancers, but still remains very difficult to plan. In this paper, w...
Caroline Villard, Claire Baegert, Pascal Schreck, ...
FOCS
2000
IEEE
14 years 1 months ago
Efficient Algorithms for Universal Portfolios
A constant rebalanced portfolio is an investment strategy that keeps the same distribution of wealth among a set of stocks from day to day. There has been much work on Cover'...
Adam Kalai, Santosh Vempala
PARELEC
2002
IEEE
14 years 2 months ago
Techniques for Optimization of Net Algorithms
In this paper, techniques for optimization of net algorithms describing parallel asynchronous computations and derived from cycling and branching behavioral descriptions are prese...
Anatoly Prihozhy, Daniel Mlynek, Michail Solomenni...