Sciweavers

2168 search results - page 108 / 434
» Using Approximation Hardness to Achieve Dependable Computati...
Sort
View
ECCV
2010
Springer
15 years 8 months ago
Efficient Highly Over-Complete Sparse Coding using a Mixture Model
Sparse coding of sensory data has recently attracted notable attention in research of learning useful features from the unlabeled data. Empirical studies show that mapping the data...
126
Voted
ISCAS
2005
IEEE
133views Hardware» more  ISCAS 2005»
15 years 9 months ago
Multiobjective VLSI cell placement using distributed simulated evolution algorithm
— Simulated Evolution (SimE) is a sound stochastic approximation algorithm based on the principles of adaptation. If properly engineered it is possible for SimE to reach nearopti...
Sadiq M. Sait, Ali Mustafa Zaidi, Mustafa I. Ali
117
Voted
ICML
2010
IEEE
15 years 4 months ago
Learning the Linear Dynamical System with ASOS
We develop a new algorithm, based on EM, for learning the Linear Dynamical System model. Called the method of Approximated Second-Order Statistics (ASOS) our approach achieves dra...
James Martens
121
Voted
IMC
2009
ACM
15 years 10 months ago
The importance of being overheard: throughput gains in wireless mesh networks
A flurry of recent work has focused on the performance gains that may be achieved by leveraging the broadcast nature of the wireless channel. In particular, researchers have obse...
Mikhail Afanasyev, Alex C. Snoeren
131
Voted
NLDB
2004
Springer
15 years 9 months ago
A Generic Coordination Model for Pervasive Computing Based on Semantic Web Languages
Human interaction occurs always in a specific context and in a particular environment, and a common knowledge base about them is essential for understanding each other. By immersi...
Amine Tafat, Michèle Courant, Béat H...