Efficient algorithms for consensus string problems minimizing both distance sum and radius Fulltext Access 8 Pages 2011
On the hardness of finding near-optimal multicuts in directed acyclic graphs Fulltext Access 8 Pages 2011
Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem Fulltext Access 8 Pages 2011
Algorithm level power efficiency optimization for CPU–GPU processing element in data intensive SIMD/SPMD computing Fulltext Access 9 Pages 2011
Performance analysis for (X,S)(X,S)-bottleneck cell in large-scale wireless networks Fulltext Access 9 Pages 2011
Stabilizing data-link over non-FIFO channels with optimal fault-resilience Fulltext Access 9 Pages 2011
A stochastic scheduling algorithm for precedence constrained tasks on Grid Fulltext Access 9 Pages 2011
An ID-based multi-signer universal designated multi-verifier signature scheme Fulltext Access 9 Pages 2011
Dynamic replication in a data grid using a Modified BHR Region Based Algorithm Fulltext Access 9 Pages 2011
Abelian complexity of infinite words associated with quadratic Parry numbers Fulltext Access 9 Pages 2011
Characterization and recognition of P4-sparse graphs partitionable into k independent sets and â cliques Fulltext Access 9 Pages 2011
Negative selection algorithms on strings with efficient training and linear-time classification Fulltext Access 9 Pages 2011
Hamiltonian properties of twisted hypercube-like networks with more faulty elements Fulltext Access 9 Pages 2011
Admission control mechanism and performance analysis based on stochastic automata networks formalism Fulltext Access 9 Pages 2011
On computing the minimum 3-path vertex cover and dissociation number of graphs Fulltext Access 9 Pages 2011
A novel re-authentication scheme based on tickets in wireless local area networks Fulltext Access 9 Pages 2011
TEASE: A novel Tunnel-based sEcure Authentication SchemE to support smooth handoff in IEEE 802.11 wireless networks Fulltext Access 9 Pages 2011
The complementary exponential geometric distribution: Model, properties, and a comparison with its counterpart Fulltext Access 9 Pages 2011
A statistical approach to high-throughput screening of predicted orthologs Fulltext Access 9 Pages 2011
Generalized weighted likelihood density estimators with application to finite mixture of exponential family distributions Fulltext Access 9 Pages 2011
Generalized additive models and inflated type I error rates of smoother significance tests Fulltext Access 9 Pages 2011
Exact and approximate algorithms for variable selection in linear discriminant analysis Fulltext Access 9 Pages 2011
Size and power properties of some tests in the Birnbaum–Saunders regression model Fulltext Access 9 Pages 2011
Approximate unconditional test procedure for comparing two ordered multinomials Fulltext Access 9 Pages 2011
A unified view on lifetime distributions arising from selection mechanisms Fulltext Access 9 Pages 2011
Fitting marginal accelerated failure time models to clustered survival data with potentially informative cluster size Fulltext Access 9 Pages 2011
A semiparametric accelerated failure time partial linear model and its application to breast cancer Fulltext Access 9 Pages 2011
Bias from misspecification of the component variances in a normal mixture Fulltext Access 9 Pages 2011
Competitive Boolean function evaluation: Beyond monotonicity, and the symmetric case Fulltext Access 9 Pages 2011
Relaxation of ACID properties in AuTrA, The adaptive user-defined transaction relaxing approach Fulltext Access 9 Pages 2011
An evaluation of the benefits of fine-grained value-based scheduling on general purpose clusters Fulltext Access 9 Pages 2011
A family of enhanced (L,α)(L,α)-diversity models for privacy preserving data publishing Fulltext Access 9 Pages 2011
Feynman Graphs, and Nerve Theorem for Compact Symmetric Multicategories (Extended Abstract) Fulltext Access 9 Pages 2011
Local condition for planar graphs of maximum degree 7 to be 8-totally colorable Fulltext Access 9 Pages 2011
Local negative circuits and fixed points in non-expansive Boolean networks Fulltext Access 9 Pages 2011
Lower bounds on the independence number of certain graphs of odd girth at least seven Fulltext Access 9 Pages 2011