Sciweavers

1687 search results - page 275 / 338
» Which pointer analysis should I use
Sort
View
GLVLSI
2003
IEEE
153views VLSI» more  GLVLSI 2003»
15 years 9 months ago
FORCE: a fast and easy-to-implement variable-ordering heuristic
The MINCE heuristic for variable-ordering [1] successfully reduces the size of BDDs and can accelerate SAT-solving. Applications to reachability analysis have also been successful...
Fadi A. Aloul, Igor L. Markov, Karem A. Sakallah
ISCAS
2003
IEEE
235views Hardware» more  ISCAS 2003»
15 years 9 months ago
Enhanced chaotic image encryption algorithm based on Baker's map
Imaging has gained importance due to the improvements of performances in computer speed, media storage and network bandwidth. Along with this advancement, the fundamental issue of...
Mazleena bt. Salleh, Subariah bt. Ibrahim, I. F. I...
RE
1999
Springer
15 years 8 months ago
An Integrated Scenario Management Strategy
Scenarios have proven effective for eliciting, describing and validating software requirements; however, scenario management continues to be a significant challenge to practition...
Thomas A. Alspaugh, Annie I. Antón, Tiffany...
SIGIR
2010
ACM
15 years 7 months ago
Adaptive near-duplicate detection via similarity learning
In this paper, we present a novel near-duplicate document detection method that can easily be tuned for a particular domain. Our method represents each document as a real-valued s...
Hannaneh Hajishirzi, Wen-tau Yih, Aleksander Kolcz
GECCO
2000
Springer
101views Optimization» more  GECCO 2000»
15 years 7 months ago
Polynomial Time Summary Statistics for Two general Classes of Functions
In previous work we showed, by Walsh analysis, that summary statistics such as mean, variance, skew, and higher order statistics can be computed in polynomial time for embedded la...
Robert B. Heckendorn