Sciweavers

5606 search results - page 1108 / 1122
» Randomization Techniques for Graphs.
Sort
View
STACS
1992
Springer
14 years 1 months ago
Speeding Up Two String-Matching Algorithms
We show how to speed up two string-matching algorithms: the Boyer-Moore algorithm (BM algorithm), and its version called here the reverse factor algorithm (RF algorithm). The RF al...
Maxime Crochemore, Thierry Lecroq, Artur Czumaj, L...
CEC
2007
IEEE
14 years 1 months ago
Mining association rules from databases with continuous attributes using genetic network programming
Most association rule mining algorithms make use of discretization algorithms for handling continuous attributes. Discretization is a process of transforming a continuous attribute...
Karla Taboada, Eloy Gonzales, Kaoru Shimada, Shing...
SP
2010
IEEE
174views Security Privacy» more  SP 2010»
14 years 29 days ago
HyperSafe: A Lightweight Approach to Provide Lifetime Hypervisor Control-Flow Integrity
— Virtualization is being widely adopted in today’s computing systems. Its unique security advantages in isolating and introspecting commodity OSes as virtual machines (VMs) ha...
Zhi Wang, Xuxian Jiang
ERSHOV
2009
Springer
14 years 29 days ago
Anti-unification Algorithms and Their Applications in Program Analysis
A term t is called a template of terms t1 and t2 iff t1 = t1 and t2 = t2, for some substitutions 1 and 2. A template t of t1 and t2 is called the most specific iff for any template...
Peter E. Bulychev, Egor V. Kostylev, Vladimir A. Z...
APPROX
2006
Springer
109views Algorithms» more  APPROX 2006»
14 years 25 days ago
Dobrushin Conditions and Systematic Scan
We consider Glauber dynamics on finite spin systems. The mixing time of Glauber dynamics can be bounded in terms of the influences of sites on each other. We consider three parame...
Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum
« Prev « First page 1108 / 1122 Last » Next »