Sciweavers

1727 search results - page 167 / 346
» A Technique for Large Automated Mechanism Design Problems
Sort
View
KDD
2006
ACM
170views Data Mining» more  KDD 2006»
16 years 7 months ago
Classification features for attack detection in collaborative recommender systems
Collaborative recommender systems are highly vulnerable to attack. Attackers can use automated means to inject a large number of biased profiles into such a system, resulting in r...
Robin D. Burke, Bamshad Mobasher, Chad Williams, R...
CN
2007
137views more  CN 2007»
15 years 6 months ago
Defending against hitlist worms using network address space randomization
Worms are self-replicating malicious programs that represent a major security threat for the Internet, as they can infect and damage a large number of vulnerable hosts at timescal...
Spyros Antonatos, Periklis Akritidis, Evangelos P....
CADE
2007
Springer
16 years 6 months ago
T-Decision by Decomposition
Much research concerning Satisfiability Modulo Theories is devoted to the design of efficient SMT-solvers that integrate a SATsolver with T -satisfiability procedures. The rewrite-...
Maria Paola Bonacina, Mnacho Echenim
GLVLSI
2009
IEEE
125views VLSI» more  GLVLSI 2009»
16 years 1 months ago
Timing-driven N-way decomposition
Logic decomposition has been extensively used to optimize the worst-case delay and the area in the technology independent phase. Bi-decomposition is one of the state-of-art techni...
David Bañeres, Jordi Cortadella, Michael Ki...
DAC
2002
ACM
16 years 7 months ago
Retargetable binary utilities
Since software is playing an increasingly important role in systemon-chip, retargetable compilation has been an active research area in the last few years. However, the retargetti...
Maghsoud Abbaspour, Jianwen Zhu