Sciweavers

16430 search results - page 585 / 3286
» On Computable Tree Functions
Sort
View
ISCC
2002
IEEE
131views Communications» more  ISCC 2002»
16 years 1 days ago
Scheduling real time parallel structure on cluster computing
: - Efficient task scheduling is essential for achieving high performance computing applications for distributed systems. Most of existing real-time systems consider schedulability...
Reda A. Ammar, Abdulrahman Alhamdan
BMVC
2000
15 years 8 months ago
A New Method for Computing Optical Flow
Accurate and high density estimation of optical flow vectors in an image sequence is accomplished by a method that estimates the velocity distribution function for small overlappi...
W. F. Clocksin
AAAI
1997
15 years 8 months ago
Incremental Methods for Computing Bounds in Partially Observable Markov Decision Processes
Partially observable Markov decision processes (POMDPs) allow one to model complex dynamic decision or control problems that include both action outcome uncertainty and imperfect ...
Milos Hauskrecht
IJHPCA
2006
109views more  IJHPCA 2006»
15 years 7 months ago
A Resource Leasing Policy for on-Demand Computing
Leasing computational resources for on-demand computing is now a viable option for providers of network services. Temporary spikes or lulls in demand for a service can be accommod...
Darin England, Jon B. Weissman
IACR
2011
97views more  IACR 2011»
14 years 6 months ago
Two-Output Secure Computation with Malicious Adversaries
We present a method to compile Yao’s two-player garbled circuit protocol into one that is secure against malicious adversaries that relies on witness indistinguishability. Our ap...
Abhi Shelat, Chih-Hao Shen