Sciweavers

2200 search results - page 64 / 440
» Bloch's Constant is Computable
Sort
View
BIRTHDAY
2003
Springer
15 years 3 months ago
Computational Proof as Experiment: Probabilistic Algorithms from a Thermodynamic Perspective
Abstract. A novel framework for the design and analysis of energy-aware algorithms is presented, centered around a deterministic Bit-level (Boltzmann) Random Access Machine or BRAM...
Krishna V. Palem
IPPS
1999
IEEE
15 years 2 months ago
Parallel Biological Sequence Comparison Using Prefix Computations
We present practical parallel algorithms using prefix computations for various problems that arise in pairwise comparison of biological sequences. We consider both constant and af...
Srinivas Aluru, Natsuhiko Futamura, Kishan Mehrotr...
WOB
2003
140views Bioinformatics» more  WOB 2003»
14 years 11 months ago
Computing Maximum Subsequence in Parallel
The maximum subsequence problem finds the contiguous subsequence of n real numbers with the highest sum. This is an important problem that arises in several contexts in Computatio...
Carlos E. R. Alves, Edson Cáceres, Siang W....
ICPR
2008
IEEE
15 years 4 months ago
Hybrid Layered Video Encoding for Mobile Internet-Based Computer Vision and Multimedia Applications
Mobile networked environments are typically resource constrained in terms of the available bandwidth and battery capacity on mobile devices. Realtime video applications entail the ...
Suchendra M. Bhandarkar, Siddhartha Chattopadhyay,...
PKC
2007
Springer
125views Cryptology» more  PKC 2007»
15 years 4 months ago
Multiparty Computation for Interval, Equality, and Comparison Without Bit-Decomposition Protocol
Damg˚ard et al. [11] showed a novel technique to convert a polynomial sharing of secret a into the sharings of the bits of a in constant rounds, which is called the bit-decomposit...
Takashi Nishide, Kazuo Ohta