Sciweavers

3819 search results - page 228 / 764
» Predicting Dependability by Testing
Sort
View
BMCBI
2006
124views more  BMCBI 2006»
13 years 8 months ago
Network-based de-noising improves prediction from microarray data
Background: Prediction of human cell response to anti-cancer drugs (compounds) from microarray data is a challenging problem, due to the noise properties of microarrays as well as...
Tsuyoshi Kato, Yukio Murata, Koh Miura, Kiyoshi As...
TIT
2010
174views Education» more  TIT 2010»
13 years 3 months ago
Toeplitz Compressed Sensing Matrices With Applications to Sparse Channel Estimation
Compressed sensing (CS) has recently emerged as a powerful signal acquisition paradigm. In essence, CS enables the recovery of high-dimensional sparse signals from relatively few ...
Jarvis Haupt, Waheed Uz Zaman Bajwa, Gil M. Raz, R...
RTAS
1998
IEEE
14 years 16 days ago
Bounding Loop Iterations for Timing Analysis
Static timing analyzers need to know the minimum and maximum number of iterations associated with each loop in a real-time program so accurate timing predictions can be obtained. ...
Christopher A. Healy, Mikael Sjödin, Viresh R...
EMNLP
2007
13 years 9 months ago
Covington Variations
Three versions of the Covington algorithm for non-projective dependency parsing have been tested on the ten different languages for the Multilingual track of the CoNLLX Shared Tas...
Svetoslav Marinov
MT
2006
101views more  MT 2006»
13 years 8 months ago
EBMT by tree-phrasing
We present a study we conducted to build a repository storing associations between simple dependency treelets in a source language and their corresponding phrases in a target lang...
Philippe Langlais, Fabrizio Gotti