Sciweavers

1754 search results - page 213 / 351
» The Computational Complexity of Delay Management
Sort
View
TNN
2010
176views Management» more  TNN 2010»
14 years 4 months ago
Sparse approximation through boosting for learning large scale kernel machines
Abstract--Recently, sparse approximation has become a preferred method for learning large scale kernel machines. This technique attempts to represent the solution with only a subse...
Ping Sun, Xin Yao
CAISE
2006
Springer
15 years 1 months ago
Loosely-Coupled Process Automation in Medical Environments
Abstract. We discuss a case study for the hospital scenario where workflow model components are distributed across various computers or devices (e.g. mobile phones, PDAs, sensors, ...
Jurate Vysniauskaite
BROADNETS
2006
IEEE
15 years 4 months ago
Distributed Job Scheduling based on Multiple Constraints Anycast Routing
— As the popularity of resource-constrained devices such as hand-held computers increases, a new network service offloading complex processing tasks towards computational resour...
Tim Stevens, Marc De Leenheer, Filip De Turck, Bar...
ISVLSI
2005
IEEE
169views VLSI» more  ISVLSI 2005»
15 years 3 months ago
High Performance Array Processor for Video Decoding
high NRE cost. Therefore, general purpose programmable processors using software to perform various functions become more attractive since programmability can simplify system devel...
J. Lee, Narayanan Vijaykrishnan, Mary Jane Irwin
JAC
2008
14 years 11 months ago
Rule 110: universality and catenations
Cellular automata are a simple model of parallel computation. Many people wonder about the computing power of such a model. Following an idea of S. Wolfram [16], M. Cook [3] has pr...
Gaétan Richard