Sciweavers

881 search results - page 131 / 177
» Solving satisfiability problems with preferences
Sort
View
IJACT
2008
64views more  IJACT 2008»
13 years 7 months ago
An efficient one-move Nominative Signature scheme
Abstract. A signer in a Nominative Signature (NS) scheme can arbitrarily choose a nominee, then jointly generate a signature in such a way that the signature can only be verified w...
Qiong Huang, Dennis Y. W. Liu, Duncan S. Wong
TON
2008
125views more  TON 2008»
13 years 7 months ago
Two techniques for fast computation of constrained shortest paths
Abstract-- Computing constrained shortest paths is fundamental to some important network functions such as QoS routing, which is to find the cheapest path that satisfies certain co...
Shigang Chen, Meongchul Song, Sartaj Sahni
JMM2
2007
96views more  JMM2 2007»
13 years 7 months ago
A Framework for Linear Transform Approximation Using Orthogonal Basis Projection
—This paper aims to develop a novel framework to systematically trade-off computational complexity with output distortion in linear multimedia transforms, in an optimal manner. T...
Yinpeng Chen, Hari Sundaram
ANOR
2004
122views more  ANOR 2004»
13 years 7 months ago
Call Center Staffing with Simulation and Cutting Plane Methods
We present an iterative cutting plane method for minimizing staffing costs in a service system subject to satisfying acceptable service level requirements over multiple time perio...
Júlíus Atlason, Marina A. Epelman, S...
CGF
2000
97views more  CGF 2000»
13 years 7 months ago
Motion Balance Filtering
This paper presents a new technique called motion balance filtering, which corrects an unbalanced motion to a balanced one while preserving the original motion characteristics as ...
Seyoon Tak, Oh-Young Song, Hyeong-Seok Ko