Sciweavers

698 search results - page 56 / 140
» Fast functional simulation using branching programs
Sort
View
ICML
2008
IEEE
16 years 2 months ago
Random classification noise defeats all convex potential boosters
A broad class of boosting algorithms can be interpreted as performing coordinate-wise gradient descent to minimize some potential function of the margins of a data set. This class...
Philip M. Long, Rocco A. Servedio
BMCBI
2005
132views more  BMCBI 2005»
15 years 1 months ago
Kalign - an accurate and fast multiple sequence alignment algorithm
Background: The alignment of multiple protein sequences is a fundamental step in the analysis of biological data. It has traditionally been applied to analyzing protein families f...
Timo Lassmann, Erik L. L. Sonnhammer
CHES
2009
Springer
200views Cryptology» more  CHES 2009»
16 years 2 months ago
Accelerating AES with Vector Permute Instructions
We demonstrate new techniques to speed up the Rijndael (AES) block cipher using vector permute instructions. Because these techniques avoid data- and key-dependent branches and mem...
Mike Hamburg
ASPLOS
1992
ACM
15 years 5 months ago
Non-Volatile Memory for Fast, Reliable File Systems
Given the decreasing cost of non-volatile RAM (NVRAM), by the late 1990's it will be feasible for most workstations to include a megabyte or more of NVRAM, enabling the desig...
Mary Baker, Satoshi Asami, Etienne Deprit, John K....
ICRA
1995
IEEE
122views Robotics» more  ICRA 1995»
15 years 5 months ago
Actuator Constraints in Optimal Motion Planning of Manipulators
The optimal motion generation problem is solved subject to various actuator constraints while the motion is constrained to an arbitrary path. The considered objective function is ...
Patrick Plédel, Yasmina Bestaoui