Sciweavers

6274 search results - page 329 / 1255
» From query complexity to computational complexity
Sort
View
236
Voted
CORR
2012
Springer
281views Education» more  CORR 2012»
14 years 2 months ago
Belief Propagation by Message Passing in Junction Trees: Computing Each Message Faster Using GPU Parallelization
Compiling Bayesian networks (BNs) to junction trees and performing belief propagation over them is among the most prominent approaches to computing posteriors in BNs. However, bel...
Lu Zheng, Ole J. Mengshoel, Jike Chong
CN
2010
109views more  CN 2010»
15 years 6 months ago
A taxonomy of biologically inspired research in computer networking
The natural world is enormous, dynamic, incredibly diverse, and highly complex. Despite the inherent challenges of surviving in such a world, biological organisms evolve, self-org...
Michael Meisel, Vasileios Pappas, Lixia Zhang
ISADS
2003
IEEE
15 years 12 months ago
An Approach to Developing Information Dissemination Service for Ubiquitous Computing Applications
In many ubiquitous computing (ubicomp) applications, such as smart classrooms, hospitals, construction sites, stadiums, shopping malls, emergency services, law enforcement, conven...
Stephen S. Yau, Sheikh Iqbal Ahamed
FPL
2009
Springer
154views Hardware» more  FPL 2009»
15 years 11 months ago
Compiler assisted runtime task scheduling on a reconfigurable computer
Multitasking reconfigurable computers with one or more reconfigurable processors are being used increasingly during the past few years. One of the major challenges in such systems...
Mojtaba Sabeghi, Vlad Mihai Sima, Koen Bertels
IJCV
2006
206views more  IJCV 2006»
15 years 6 months ago
Highly Accurate Optic Flow Computation with Theoretically Justified Warping
In this paper, we suggest a variational model for optic flow computation based on non-linearised and higher order constancy assumptions. Besides the common grey value constancy ass...
Nils Papenberg, Andrés Bruhn, Thomas Brox, ...