Sciweavers

6365 search results - page 400 / 1273
» Fast Local Computation Algorithms
Sort
View
ISMB
1993
15 years 8 months ago
Identification of Localized and Distributed Bottlenecks in Metabolic Pathways
The usual thermodynamicevaluation, based solely on the Standard Gibbs Energyof reaction, does not take into account the permissible ranges of concentrations of metabolites, and it...
Michael L. Mavrovouniotis
ACL
2009
15 years 4 months ago
Coordinate Structure Analysis with Global Structural Constraints and Alignment-Based Local Features
We propose a hybrid approach to coordinate structure analysis that combines a simple grammar to ensure consistent global structure of coordinations in a sentence, and features bas...
Kazuo Hara, Masashi Shimbo, Hideharu Okuma, Yuji M...
ICASSP
2011
IEEE
14 years 10 months ago
An efficient variable step-size proportionate affine projection algorithm
Proportionate-type affine projection algorithms (PAPAs) are very attractive choices for echo cancellation. These algorithms combine the good features (convergence and tracking) o...
Constantin Paleologu, Jacob Benesty, Felix Albu, S...
ICRA
1995
IEEE
188views Robotics» more  ICRA 1995»
15 years 10 months ago
Fast Approximation of Range Images by Triangular Meshes Generated through Adaptive Randomized Sampling
This paper describes and evaluates an efficient technique that allows the fast generation of 3D triangular meshes from range images avoiding optimization procedures. Such a tool ...
Miguel Angel García
JMLR
2006
124views more  JMLR 2006»
15 years 6 months ago
Fast SDP Relaxations of Graph Cut Clustering, Transduction, and Other Combinatorial Problem
The rise of convex programming has changed the face of many research fields in recent years, machine learning being one of the ones that benefitted the most. A very recent develop...
Tijl De Bie, Nello Cristianini