Sciweavers

3172 search results - page 87 / 635
» On the Random-Self-Reducibility of Complete Sets
Sort
View
IPL
2008
129views more  IPL 2008»
15 years 24 days ago
Parameterized approximation of dominating set problems
A problem open for many years is whether there is an FPT algorithm that given a graph G and parameter k, either: (1) determines that G has no k-Dominating Set, or (2) produces a do...
Rodney G. Downey, Michael R. Fellows, Catherine Mc...
JAR
2006
81views more  JAR 2006»
15 years 23 days ago
Verifying the SET Purchase Protocols
SET (Secure Electronic Transaction) is a suite of protocols proposed by a consortium of credit card companies and software corporations to secure ecommerce transactions. The Purcha...
Giampaolo Bella, Fabio Massacci, Lawrence C. Pauls...
ACS
2004
15 years 21 days ago
One Setting for All: Metric, Topology, Uniformity, Approach Structure
For a complete lattice V which, as a category, is monoidal closed, and for a suitable Setmonad T we consider (T, V)-algebras and introduce (T, V)-proalgebras, in generalization of...
Maria Manuel Clementino, Dirk Hofmann, Walter Thol...
127
Voted
ECAI
2010
Springer
15 years 1 months ago
Using Bayesian Networks in an Industrial Setting: Making Printing Systems Adaptive
Abstract. Control engineering is a field of major industrial importance as it offers principles for engineering controllable physical devices, such as cell phones, television sets,...
Arjen Hommersom, Peter J. F. Lucas
CHI
1994
ACM
15 years 4 months ago
Using aggregation and dynamic queries for exploring large data sets
When working with large data sets, users perform three primary types of activities: data manipulation, data analysis, and data visualization. The data manipulation process involve...
Jade Goldstein, Steven F. Roth