Sciweavers

3110 search results - page 88 / 622
» On the initialization of the DNMF algorithm
Sort
View
130
Voted
DAWAK
2005
Springer
15 years 10 months ago
Gene Expression Biclustering Using Random Walk Strategies
A biclustering algorithm, based on a greedy technique and enriched with a local search strategy to escape poor local minima, is proposed. The algorithm starts with an initial rando...
Fabrizio Angiulli, Clara Pizzuti
ACL
2007
15 years 6 months ago
Generating Constituent Order in German Clauses
We investigate the factors which determine constituent order in German clauses and propose an algorithm which performs the task in two steps: First, the best candidate for the ini...
Katja Filippova, Michael Strube
FLAIRS
2006
15 years 6 months ago
A Machine Learning Approach to Determine Semantic Dependency Structure in Chinese
In this paper, we attempt to automatically annotate the Penn Chinese Treebank with semantic dependency structure. Initially a small portion of the Penn Chinese Treebank was manual...
Jiajun Yan, David B. Bracewell, Fuji Ren, Shingo K...
AUTOMATICA
2008
94views more  AUTOMATICA 2008»
15 years 4 months ago
Reachability analysis of continuous-time piecewise affine systems
This paper proposes an algorithm for the characterization of reachable sets of states for continuous-time piecewise affine systems. Given a model of the system and a bounded set o...
Abdullah Hamadeh, Jorge Goncalves
ISCI
2008
102views more  ISCI 2008»
15 years 4 months ago
Random walk biclustering for microarray data
A biclustering algorithm, based on a greedy technique and enriched with a local search strategy to escape poor local minima, is proposed. The algorithm starts with an initial rand...
Fabrizio Angiulli, Eugenio Cesario, Clara Pizzuti