Sciweavers

2430 search results - page 139 / 486
» Computing Tutte Polynomials
Sort
View
LPAR
2010
Springer
15 years 2 months ago
ABC: Algebraic Bound Computation for Loops
Abstract. We present ABC, a software tool for automatically computing symbolic upper bounds on the number of iterations of nested program loops. The system combines static analysis...
Régis Blanc, Thomas A. Henzinger, Thibaud H...
RSFDGRC
2005
Springer
134views Data Mining» more  RSFDGRC 2005»
15 years 10 months ago
The Computational Complexity of Inference Using Rough Set Flow Graphs
Pawlak recently introduced rough set flow graphs (RSFGs) as a graphical framework for reasoning from data. Each rule is associated with three coefficients, which have been shown t...
Cory J. Butz, Wen Yan, Boting Yang
125
Voted
ERCIMDL
2004
Springer
116views Education» more  ERCIMDL 2004»
15 years 10 months ago
Towards a Policy Language for Humans and Computers
Abstract. A policy is a statement that an action is permitted or forbidden if certain conditions hold. We introduce a language for reasoning about policies called Rosetta. What mak...
Vicky Weissman, Carl Lagoze
ISMVL
2002
IEEE
84views Hardware» more  ISMVL 2002»
15 years 9 months ago
The Role of Super-Fast Transforms in Speeding Up Quantum Computations
We present the role that spectral methods play in the development of the most impressive quantum algorithms, such as the polynomial time number factoring algorithm by Shor. While ...
Zeljko Zilic, Katarzyna Radecka
WADS
1995
Springer
82views Algorithms» more  WADS 1995»
15 years 8 months ago
On the Computation of Fast Data Transmissions in Networks with Capacities and Delays
We examine the problem of transmitting in minimum time a given amount of data between a source and a destination in a network with finite channel capacities and non–zero propaga...
Dimitrios Kagaris, Spyros Tragoudas, Grammati E. P...