Sciweavers

425 search results - page 7 / 85
» Polynomial Time Data Reduction for Dominating Set
Sort
View
DAGSTUHL
2006
14 years 10 months ago
Decentralization and Mechanism Design for Online Machine Scheduling
We study the online version of the classical parallel machine scheduling problem to minimize the total weighted completion time from a new perspective: We assume that the data of ...
Birgit Heydenreich, Rudolf Müller, Marc Uetz
DATE
1997
IEEE
99views Hardware» more  DATE 1997»
15 years 1 months ago
Fast controllers for data dominated applications
A target structure for implementing fast edge-triggered control units is presented. In many cases, the proposed controller is faster than a one-hot encoded structure as its correc...
Andre Hertwig, Hans-Joachim Wunderlich
PODS
2006
ACM
137views Database» more  PODS 2006»
15 years 9 months ago
Data exchange: computing cores in polynomial time
Data exchange deals with inserting data from one database into another database having a different schema. We study and solve a central computational problem of data exchange, nam...
Georg Gottlob, Alan Nash
AAAI
2006
14 years 10 months ago
Algorithms for Rationalizability and CURB Sets
Significant work has been done on computational aspects of solving games under various solution concepts, such as Nash equilibrium, subgame perfect Nash equilibrium, correlated eq...
Michael Benisch, George B. Davis, Tuomas Sandholm
ASAP
2004
IEEE
141views Hardware» more  ASAP 2004»
15 years 1 months ago
Evaluating Instruction Set Extensions for Fast Arithmetic on Binary Finite Fields
Binary finite fields GF(2n ) are very commonly used in cryptography, particularly in publickey algorithms such as Elliptic Curve Cryptography (ECC). On word-oriented programmable ...
A. Murat Fiskiran, Ruby B. Lee