Sciweavers

2430 search results - page 473 / 486
» Computing Tutte Polynomials
Sort
View
HYBRID
2001
Springer
14 years 5 days ago
Accurate Event Detection for Simulating Hybrid Systems
It has been observed that there are a variety of situations in which the most popular hybrid simulation methods can fail to properly detect the occurrence of discrete events. In th...
Joel M. Esposito, Vijay Kumar, George J. Pappas
ISSTA
2000
ACM
14 years 1 days ago
Which pointer analysis should I use?
During the past two decades many di erent pointer analysis algorithms have been published. Although some descriptions include measurements of the e ectiveness of the algorithm, qu...
Michael Hind, Anthony Pioli
STOC
2000
ACM
174views Algorithms» more  STOC 2000»
14 years 1 days ago
Noise-tolerant learning, the parity problem, and the statistical query model
We describe a slightly subexponential time algorithm for learning parity functions in the presence of random classification noise, a problem closely related to several cryptograph...
Avrim Blum, Adam Kalai, Hal Wasserman
DBPL
1999
Springer
109views Database» more  DBPL 1999»
13 years 12 months ago
Expressing Topological Connectivity of Spatial Databases
We consider two-dimensional spatial databases defined in terms of polynomial inequalities and focus on the potential of programming languages for such databases to express queries...
Floris Geerts, Bart Kuijpers
STOC
1997
ACM
125views Algorithms» more  STOC 1997»
13 years 12 months ago
An Interruptible Algorithm for Perfect Sampling via Markov Chains
For a large class of examples arising in statistical physics known as attractive spin systems (e.g., the Ising model), one seeks to sample from a probability distribution π on an...
James Allen Fill