Sciweavers

6365 search results - page 338 / 1273
» Fast Local Computation Algorithms
Sort
View
198
Voted
SADM
2008
178views more  SADM 2008»
15 years 6 months ago
Fast Projection-Based Methods for the Least Squares Nonnegative Matrix Approximation Problem
: Nonnegative matrix approximation (NNMA) is a popular matrix decomposition technique that has proven to be useful across a diverse variety of fields with applications ranging from...
Dongmin Kim, Suvrit Sra, Inderjit S. Dhillon
IWCMC
2010
ACM
15 years 8 months ago
Decentralized service composition in pervasive computing environments
In a pervasive computing environment, the devices are embedded in the physical world, providing services and interconnected by a communication network. Composition of these servic...
Joanna Izabela Siebert, Jiannong Cao, Long Cheng, ...
BMCBI
2006
120views more  BMCBI 2006»
15 years 6 months ago
Optimizing amino acid substitution matrices with a local alignment kernel
Background: Detecting remote homologies by direct comparison of protein sequences remains a challenging task. We had previously developed a similarity score between sequences, cal...
Hiroto Saigo, Jean-Philippe Vert, Tatsuya Akutsu
CIVR
2007
Springer
173views Image Analysis» more  CIVR 2007»
16 years 27 days ago
Fast and cheap object recognition by linear combination of views
In this paper, we present a real-time algorithm for 3D object detection in images. Our method relies on the Ullman and Basri [13] theory which claims that the same object under di...
Jérome Revaud, Guillaume Lavoué, Yas...
ICRA
2006
IEEE
90views Robotics» more  ICRA 2006»
16 years 23 days ago
A Fast and Adaptive Test of Static Equilibrium for Legged Robots
— A legged robot walking on uneven terrain can avoid falling only by applying contact forces with its feet on the ground that compensate for gravity without causing slip. To plan...
Timothy Bretl, Sanjay Lall