Sciweavers

2254 search results - page 109 / 451
» Computing the minimal covering set
Sort
View
84
Voted
JCT
2011
74views more  JCT 2011»
14 years 7 months ago
Basis theorems for continuous n-colorings
This article is devoted to the study of continuous colorings of the n-element subsets of a Polish space. The homogeneity number hm(c) of an n-coloring c : [X]n → 2 is the least s...
Stefanie Frick, Stefan Geschke
103
Voted
EUROCRYPT
2007
Springer
15 years 4 months ago
Round-Efficient Secure Computation in Point-to-Point Networks
Essentially all work studying the round complexity of secure computation assumes broadcast as an atomic primitive. Protocols constructed under this assumption tend to have very poo...
Jonathan Katz, Chiu-Yuen Koo
100
Voted
PERCOM
2004
ACM
16 years 10 days ago
A User-Guided Cognitive Agent for Network Service Selection in Pervasive Computing Environments
Connectivity is central to pervasive computing environments. We seek to catalyze a world of rich and diverse connectivity through technologies that drastically simplify the task o...
George Lee, Peyman Faratin, Steven Bauer, John Wro...
AAAI
2008
15 years 3 months ago
Computing Observation Vectors for Max-Fault Min-Cardinality Diagnoses
Model-Based Diagnosis (MBD) typically focuses on diagnoses, minimal under some minimality criterion, e.g., the minimal-cardinality set of faulty components that explain an observa...
Alexander Feldman, Gregory M. Provan, Arjan J. C. ...
CF
2008
ACM
15 years 2 months ago
Exact combinational logic synthesis and non-standard circuit design
Using a new exact synthesizer that automatically induces minimal universal boolean function libraries, we introduce two indicators for comparing their expressiveness: the first ba...
Paul Tarau, Brenda Luderman