Sciweavers

2778 search results - page 155 / 556
» Limit complexities revisited
Sort
View
JMLR
2010
182views more  JMLR 2010»
15 years 1 months ago
Quadratic Programming Feature Selection
Identifying a subset of features that preserves classification accuracy is a problem of growing importance, because of the increasing size and dimensionality of real-world data se...
Irene Rodriguez-Lujan, Ramón Huerta, Charle...
TC
2010
15 years 1 months ago
Speculatively Redundant Continued Logarithm Representation
Continued logarithms, as originally introduced by Gosper, represent a means for exact rational arithmetic, but their application to exact real arithmetic is limited by the uniquene...
Tomas Brabec
IEEEARES
2010
IEEE
16 years 1 months ago
Strategies for Reducing Risks of Inconsistencies in Access Control Policies
—Managing access control policies is a complex task. We argue that much of the complexity is unnecessary and mostly due to historical reasons. There are number of legacy policy s...
Bernard Stepien, Stan Matwin, Amy P. Felty
ALMOB
2008
95views more  ALMOB 2008»
15 years 6 months ago
A stitch in time: Efficient computation of genomic DNA melting bubbles
Background: It is of biological interest to make genome-wide predictions of the locations of DNA melting bubbles using statistical mechanics models. Computationally, this poses th...
Eivind Tøstesen
ICCAD
2007
IEEE
128views Hardware» more  ICCAD 2007»
16 years 3 months ago
Module assignment for pin-limited designs under the stacked-Vdd paradigm
Abstract— This paper addresses the module assignment problem in pinlimited designs under the stacked-Vdd circuit paradigm. A partition-based algorithm is presented for efficient...
Yong Zhan, Tianpei Zhang, Sachin S. Sapatnekar