Sciweavers

613 search results - page 118 / 123
» Finding and Fixing Faults
Sort
View
MST
2006
104views more  MST 2006»
14 years 9 months ago
Sequencing from Compomers: The Puzzle
The board game FragmindTM poses the following problem: The player has to reconstruct an (unknown) string s over the alphabet . To this end, the game reports the following informati...
Sebastian Böcker
TASE
2008
IEEE
14 years 9 months ago
Randomized Optimal Design of Parallel Manipulators
This work intends to deal with the optimal kinematic synthesis problem of parallel manipulators under a unified framework. Observing that regular (e.g., hyper-rectangular) workspac...
Yunjiang Lou, Guanfeng Liu, Zexiang Li
BIOINFORMATICS
2005
152views more  BIOINFORMATICS 2005»
14 years 9 months ago
Intervention in context-sensitive probabilistic Boolean networks
Motivation: Intervention in a gene regulatory network is used to help it avoid undesirable states, such as those associated with a disease. Several types of intervention have been...
Ranadip Pal, Aniruddha Datta, Michael L. Bittner, ...
BMCBI
2005
140views more  BMCBI 2005»
14 years 9 months ago
Dissecting systems-wide data using mixture models: application to identify affected cellular processes
Background: Functional analysis of data from genome-scale experiments, such as microarrays, requires an extensive selection of differentially expressed genes. Under many condition...
J. Peter Svensson, Renée X. de Menezes, Ing...
TOC
2008
94views more  TOC 2008»
14 years 9 months ago
Optimal lower bounds for the Korkine-Zolotareff parameters of a lattice and for Schnorr's algorithm for the shortest vector prob
Abstract: Schnorr's algorithm for finding an approximation for the shortest nonzero vector in an n-dimensional lattice depends on a parameter k. He proved that for a fixed k ...
Miklós Ajtai