Sciweavers

1727 search results - page 159 / 346
» A Technique for Large Automated Mechanism Design Problems
Sort
View
DAC
2009
ACM
16 years 7 months ago
Efficient SAT solving for non-clausal formulas using DPLL, graphs, and watched cuts
Boolean satisfiability (SAT) solvers are used heavily in hardware and software verification tools for checking satisfiability of Boolean formulas. Most state-of-the-art SAT solver...
Himanshu Jain, Edmund M. Clarke
KDD
2006
ACM
165views Data Mining» more  KDD 2006»
16 years 7 months ago
Training linear SVMs in linear time
Linear Support Vector Machines (SVMs) have become one of the most prominent machine learning techniques for highdimensional sparse data commonly encountered in applications like t...
Thorsten Joachims
ISCC
2009
IEEE
129views Communications» more  ISCC 2009»
16 years 1 months ago
Handling dynamics in gossip-based aggregation schemes
A problem in large and dynamic networks consists in making available at each node global information about the state of the network. Gossip-based aggregation schemes are a simple ...
Nicola Bicocchi, Marco Mamei, Franco Zambonelli
IPAW
2010
15 years 4 months ago
The Provenance of Workflow Upgrades
Provenance has become an increasingly important part of documenting, verifying, and reproducing scientific research, but as users seek to extend or share results, it may be imprac...
David Koop, Carlos Eduardo Scheidegger, Juliana Fr...
ESORICS
2009
Springer
16 years 1 months ago
Security Threat Mitigation Trends in Low-Cost RFID Systems
Abstract. The design and implementation of security threat mitigation mechanisms in RFID systems, specially in low-cost RFID tags, are gaining great attention in both industry and ...
Joaquín García-Alfaro, Michel Barbea...