Sciweavers

59 search results - page 3 / 12
» Dominating Subsets under Projections
Sort
View
MFCS
2001
Springer
14 years 2 months ago
Characterization of Context-Free Languages with Polynomially Bounded Ambiguity
Abstract. We prove that the class of context-free languages with polynomially bounded ambiguity (PCFL) is the closure of the class of unambiguous languages (UCFL) under projections...
Klaus Wich
ISCA
2002
IEEE
112views Hardware» more  ISCA 2002»
14 years 2 months ago
Drowsy Caches: Simple Techniques for Reducing Leakage Power
On-chip caches represent a sizable fraction of the total power consumption of microprocessors. Although large caches can significantly improve performance, they have the potential...
Krisztián Flautner, Nam Sung Kim, Steven M....
TCC
2012
Springer
240views Cryptology» more  TCC 2012»
12 years 5 months ago
Computing on Authenticated Data
In tandem with recent progress on computing on encrypted data via fully homomorphic encryption, we present a framework for computing on authenticated data via the notion of slight...
Jae Hyun Ahn, Dan Boneh, Jan Camenisch, Susan Hohe...
WG
2009
Springer
14 years 4 months ago
The Parameterized Complexity of Some Minimum Label Problems
We study the parameterized complexity of several minimum label graph problems, in which we are given an undirected graph whose edges are labeled, and a property Π, and we are ask...
Michael R. Fellows, Jiong Guo, Iyad A. Kanj
WSC
2007
14 years 3 days ago
Partial cross training in call centers with uncertain arrivals and global service level agreements
Inbound call center operations are challenging to manage; there is considerable uncertainty in estimates of arrival rates, and the operation is often subject to strict service lev...
Thomas R. Robbins, Terry P. Harrison, Deborah J. M...