Sciweavers

6142 search results - page 663 / 1229
» The Complexity of Partition Functions
Sort
View
SI3D
2006
ACM
16 years 1 months ago
Interactive 3D distance field computation using linear factorization
We present an interactive algorithm to compute discretized 3D Euclidean distance fields. Given a set of piecewise linear geometric primitives, our algorithm computes the distance...
Avneesh Sud, Naga K. Govindaraju, Russell Gayle, D...
EEE
2005
IEEE
16 years 22 days ago
A Broker-Based Framework for QoS-Aware Web Service Composition
Web services are modular web applications that can be independently deployed and invoked by other software or services on the web. This offers enterprises the capability to integr...
Tao Yu, Kwei-Jay Lin
ISPASS
2005
IEEE
16 years 21 days ago
Analysis of Network Processing Workloads
Abstract— Network processing is becoming an increasingly important paradigm as the Internet moves towards an architecture with more complex functionality inside the network. Mode...
Ramaswamy Ramaswamy, Ning Weng, Tilman Wolf
RTSS
2005
IEEE
16 years 21 days ago
Voltage Scaling Scheduling for Periodic Real-Time Tasks in Reward Maximization
— This paper is interested in reward maximization of periodic real-time tasks under a given energy constraint, where the reward received depends on how much computation a task ru...
Jian-Jia Chen, Tei-Wei Kuo
ASIACRYPT
2005
Springer
16 years 20 days ago
Parallel Multi-party Computation from Linear Multi-secret Sharing Schemes
Abstract. As an extension of multi-party computation (MPC), we propose the concept of secure parallel multi-party computation which is to securely compute multi-functions against a...
Zhifang Zhang, Mulan Liu, Liangliang Xiao