Sciweavers

2107 search results - page 351 / 422
» Computing Small Search Numbers in Linear Time
Sort
View
CADE
2007
Springer
14 years 9 months ago
Towards Efficient Satisfiability Checking for Boolean Algebra with Presburger Arithmetic
Boolean Algebra with Presburger Arithmetic (BAPA) is a decidable logic that combines 1) Boolean algebra of sets of uninterpreted elements (BA) and 2) Presburger arithmetic (PA). BA...
Viktor Kuncak, Martin C. Rinard
IEEEPACT
2000
IEEE
14 years 1 months ago
A Lightweight Algorithm for Dynamic If-Conversion during Dynamic Optimization
Dynamic Optimization is an umbrella term that refers to any optimization of software that is performed after the initial compile time. It is a complementary optimization opportuni...
Kim M. Hazelwood, Thomas M. Conte
BMCBI
2006
126views more  BMCBI 2006»
13 years 9 months ago
Differential prioritization between relevance and redundancy in correlation-based feature selection techniques for multiclass ge
Background: Due to the large number of genes in a typical microarray dataset, feature selection looks set to play an important role in reducing noise and computational cost in gen...
Chia Huey Ooi, Madhu Chetty, Shyh Wei Teng
SOICT
2010
13 years 3 months ago
Password recovery for encrypted ZIP archives using GPUs
Protecting data by passwords in documents such as DOC, PDF or RAR, ZIP archives has been demonstrated to be weak under dictionary attacks. Time for recovering the passwords of suc...
Pham Hong Phong, Phan Duc Dung, Duong Nhat Tan, Ng...
CAD
2006
Springer
13 years 9 months ago
An efficient, error-bounded approximation algorithm for simulating quasi-statics of complex linkages
Design and analysis of articulated mechanical structures, commonly referred to as linkages, is an integral part of any CAD/CAM system. The most common approaches formulate the pro...
Stephane Redon, Ming C. Lin