Sciweavers

1096 search results - page 37 / 220
» Computation Slicing: Techniques and Theory
Sort
View
ECCV
2006
Springer
13 years 11 months ago
Wavelet-Based Super-Resolution Reconstruction: Theory and Algorithm
We present an analysis and algorithm for the problem of super-resolution imaging, that is the reconstruction of HR (high-resolution) images from a sequence of LR (lowresolution) im...
Hui Ji, Cornelia Fermüller
JHSN
2002
68views more  JHSN 2002»
13 years 7 months ago
A theory of multi-channel schedulers for quality of service
A computer network consists of a set of computing nodes interconnected via communication channels. It is commonly assumed that, for each pair of network nodes u and v, there is at...
Jorge Arturo Cobb, Miaohua Lin
JPDC
2007
147views more  JPDC 2007»
13 years 7 months ago
Energy optimal data propagation in wireless sensor networks
We propose an algorithm to compute the optimal parameters of a probabilistic data propagation algorithm for wireless sensor networks (WSN). The probabilistic data propagation algo...
Olivier Powell, Pierre Leone, José D. P. Ro...
COMBINATORICS
2004
102views more  COMBINATORICS 2004»
13 years 7 months ago
Satisfiability and Computing van der Waerden Numbers
In this paper we bring together the areas of combinatorics and propositional satisfiability. Many combinatorial theorems establish, often constructively, the existence of positive...
Michael R. Dransfield, Lengning Liu, Victor W. Mar...
SODA
2000
ACM
95views Algorithms» more  SODA 2000»
13 years 9 months ago
Towards a theory of cache-efficient algorithms
We present a model that enables us to analyze the running time of an algorithm on a computer with a memory hierarchy with limited associativity, in terms of various cache parameter...
Sandeep Sen, Siddhartha Chatterjee