Sciweavers

189 search results - page 17 / 38
» Interpolation of Functions Related to the Integer Factoring ...
Sort
View
IPPS
1998
IEEE
13 years 11 months ago
Processor Lower Bound Formulas for Array Computations and Parametric Diophantine Systems
Using a directed acyclic graph (dag) model of algorithms, we solve a problem related to precedenceconstrained multiprocessor schedules for array computations: Given a sequence of ...
Peter R. Cappello, Ömer Egecioglu
BMCBI
2010
98views more  BMCBI 2010»
13 years 7 months ago
A semi-nonparametric mixture model for selecting functionally consistent proteins
Background: High-throughput technologies have led to a new era of proteomics. Although protein microarray experiments are becoming more common place there are a variety of experim...
Lianbo Yu, R. W. Doerge
FSTTCS
2003
Springer
14 years 22 days ago
Comparing Sequences with Segment Rearrangements
Computational genomics involves comparing sequences based on “similarity” for detecting evolutionary and functional relationships. Until very recently, available portions of th...
Funda Ergün, S. Muthukrishnan, Süleyman ...
CVPR
2009
IEEE
15 years 2 months ago
Unsupervised Maximum Margin Feature Selection with Manifold Regularization
Feature selection plays a fundamental role in many pattern recognition problems. However, most efforts have been focused on the supervised scenario, while unsupervised feature s...
Bin Zhao, James Tin-Yau Kwok, Fei Wang, Changshui ...
LFCS
2007
Springer
14 years 1 months ago
Verifying Balanced Trees
Abstract. Balanced search trees provide guaranteed worst-case time performance and hence they form a very important class of data structures. However, the self-balancing ability co...
Zohar Manna, Henny B. Sipma, Ting Zhang