Sciweavers

533 search results - page 64 / 107
» The Computational Complexity of Sensitivity Analysis and Par...
Sort
View
COMPGEOM
2007
ACM
13 years 11 months ago
On the hardness of minkowski addition and related operations
For polytopes P, Q Rd we consider the intersection P Q; the convex hull of the union CH(P Q); and the Minkowski sum P + Q. We prove that given rational H-polytopes P1, P2, Q it...
Hans Raj Tiwary
IPL
2007
69views more  IPL 2007»
13 years 7 months ago
On the fixed-parameter tractability of the equivalence test of monotone normal forms
We consider the problem Monet—given two monotone formulas ϕ in DNF and ψ in CNF, decide whether they are equivalent. While Monet is probably not coNPhard, it is a long standin...
Matthias Hagen
ICIP
2007
IEEE
13 years 11 months ago
Lipreading by Locality Discriminant Graph
The major problem in building a good lipreading system is to extract effective visual features from enormous quantity of video sequences data. For appearance-based feature analysi...
Yun Fu, Xi Zhou, Ming Liu, Mark Hasegawa-Johnson, ...
ICDCSW
2005
IEEE
14 years 1 months ago
Control Theory Optimization of MECN in Satellite Networks
Congestion in the Internet results in wasted bandwidth and also stands in the way of guaranteeing QoS. The effect of congestion is multiplied many fold in Satellite networks, wher...
Arjan Durresi, Mukundan Sridharan, Sriram Chellapp...
CCS
2006
ACM
13 years 11 months ago
Beyond separation of duty: an algebra for specifying high-level security policies
A high-level security policy states an overall requirement for a sensitive task. One example of a high-level security policy is a separation of duty policy, which requires a sensi...
Ninghui Li, Qihua Wang