Sciweavers

2661 search results - page 497 / 533
» Quantum Complexity Classes
Sort
View
ACMICEC
2004
ACM
171views ECommerce» more  ACMICEC 2004»
15 years 6 months ago
Efficient integration of web services with distributed data flow and active mediation
This paper presents a loosely coupled service-composition paradigm. This paradigm employs a distributed data flow that differs markedly from centralized information flow adopted b...
David Liu, Jun Peng, Kincho H. Law, Gio Wiederhold
MMSEC
2004
ACM
205views Multimedia» more  MMSEC 2004»
15 years 6 months ago
Wavelet-based blind watermarking of 3D models
Watermarking of 3D meshes has received a limited attention due to the difficulties encountered in extending the algorithms developed for 1D (audio) and 2D (images and video) signa...
F. Uccheddu, Massimiliano Corsini, Mauro Barni
99
Voted
PODC
2004
ACM
15 years 6 months ago
Mechanism design for policy routing
The Border Gateway Protocol (BGP) for interdomain routing is designed to allow autonomous systems (ASes) to express policy preferences over alternative routes. We model these pref...
Joan Feigenbaum, Rahul Sami, Scott Shenker
107
Voted
AMAI
2004
Springer
15 years 6 months ago
Approximate Probabilistic Constraints and Risk-Sensitive Optimization Criteria in Markov Decision Processes
The majority of the work in the area of Markov decision processes has focused on expected values of rewards in the objective function and expected costs in the constraints. Althou...
Dmitri A. Dolgov, Edmund H. Durfee
97
Voted
COCO
2004
Springer
84views Algorithms» more  COCO 2004»
15 years 6 months ago
Properties of NP-Complete Sets
We study several properties of sets that are complete for NP. We prove that if L is an NP-complete set and S ⊇ L is a p-selective sparse set, then L − S is ≤p m-hard for NP....
Christian Glaßer, Aduri Pavan, Alan L. Selma...