Sciweavers

6142 search results - page 270 / 1229
» The Complexity of Partition Functions
Sort
View
DAC
1996
ACM
15 years 10 months ago
A Boolean Approach to Performance-Directed Technology Mapping for LUT-Based FPGA Designs
Abstract -- This paper presents a novel, Boolean approach to LUTbased FPGA technology mapping targeting high performance. As the core of the approach, we have developed a powerful ...
Christian Legl, Bernd Wurth, Klaus Eckl
DICTA
2007
15 years 7 months ago
Visual Tracking Based on Color Kernel Densities of Spatial Awareness
We propose a kernel-density based scheme that incorporates the object colors with their spatial relevance to track the object in a video sequence. The object is modeled by the col...
Zhuan Qing Huang, Zhuhan Jiang
136
Voted
AAAI
2012
13 years 8 months ago
Optimizing Payments in Dominant-Strategy Mechanisms for Multi-Parameter Domains
In AI research, mechanism design is typically used to allocate tasks and resources to agents holding private information about their values for possible allocations. In this conte...
Lachlan Thomas Dufton, Victor Naroditskiy, Maria P...
205
Voted
DMIN
2006
146views Data Mining» more  DMIN 2006»
15 years 7 months ago
A Comparison of Two Document Clustering Approaches for Clustering Medical Documents
Medical data is often presented as free text in the form of medical reports. Such documents contain important information about patients, disease progression and management, but ar...
Fathi H. Saad, Beatriz de la Iglesia, Duncan G. Be...
ICISC
2007
96views Cryptology» more  ICISC 2007»
15 years 7 months ago
Colliding Message Pair for 53-Step HAS-160
We present a collision attack on the hash function HAS-160 reduced to 53-steps. The attack has a complexity of about 235 hash computations. The attack is based on the work of Cho e...
Florian Mendel, Vincent Rijmen