Sciweavers

853 search results - page 22 / 171
» Are many small sets explicitly small
Sort
View
158
Voted
BNCOD
1998
84views Database» more  BNCOD 1998»
15 years 7 months ago
Considering Integrity Constraints During Federated Database Design
Correct transformations and integrations of schemata within the process of federated database design have to encompass existing local integrity constraints. Most of the proposed me...
Stefan Conrad, Ingo Schmitt, Can Türker
171
Voted
SP
2008
IEEE
134views Security Privacy» more  SP 2008»
15 years 6 months ago
Expressive Declassification Policies and Modular Static Enforcement
This paper provides a way to specify expressive declassification policies, in particular, when, what, and where policies that include conditions under which downgrading is allowed...
Anindya Banerjee, David A. Naumann, Stan Rosenberg
143
Voted
COLING
2008
15 years 6 months ago
A Joint Information Model for N-Best Ranking
In this paper, we present a method for modeling joint information when generating n-best lists. We apply the method to a novel task of characterizing the similarity of a group of ...
Patrick Pantel, Vishnu Vyas
154
Voted
ASPDAC
2000
ACM
95views Hardware» more  ASPDAC 2000»
15 years 10 months ago
FSM decomposition by direct circuit manipulation applied to low power design
Abstract— Clock-gating techniques are very effective in the reduction of the switching activity in sequential logic circuits. In particular, recent work has shown that significa...
José C. Monteiro, Arlindo L. Oliveira
SIGECOM
2009
ACM
137views ECommerce» more  SIGECOM 2009»
16 years 20 days ago
An exact almost optimal algorithm for target set selection in social networks
The Target Set Selection problem proposed by Kempe, Kleinberg, and Tardos, gives a nice clean combinatorial formulation for many problems arising in economy, sociology, and medicin...
Oren Ben-Zwi, Danny Hermelin, Daniel Lokshtanov, I...