Sciweavers

340 search results - page 5 / 68
» A New Algorithm for the Construction of Optimal B-Trees
Sort
View
ISPD
2012
ACM
288views Hardware» more  ISPD 2012»
12 years 3 months ago
Construction of realistic gate sizing benchmarks with known optimal solutions
Gate sizing in VLSI design is a widely-used method for power or area recovery subject to timing constraints. Several previous works have proposed gate sizing heuristics for power ...
Andrew B. Kahng, Seokhyeong Kang
WWW
2011
ACM
13 years 2 months ago
Automatic construction of a context-aware sentiment lexicon: an optimization approach
The explosion of Web opinion data has made essential the need for automatic tools to analyze and understand people’s sentiments toward different topics. In most sentiment analy...
Yue Lu, Malú Castellanos, Umeshwar Dayal, C...
ASIACRYPT
2003
Springer
14 years 25 days ago
New Parallel Domain Extenders for UOWHF
We present two new parallel algorithms for extending the domain of a UOWHF. The first algorithm is complete binary tree based construction and has less key length expansion than S...
Wonil Lee, Donghoon Chang, Sangjin Lee, Soo Hak Su...
ICASSP
2011
IEEE
12 years 11 months ago
A new speaker identification algorithm for gaming scenarios
Speaker identification is a well-established research problem but has not been a major application used in gaming scenarios. In this paper, we propose a new algorithm for the ope...
Hoang Do, Ivan Tashev, Alex Acero
ICPP
1993
IEEE
13 years 11 months ago
Activity Counter: New Optimization for the Dynamic Scheduling of SIMD Control Flow
SIMD or vector computers and collection-oriented languages, like C , are designed to perform the same computation on each data item or on just a subset of the data. Subsets of pro...
Ronan Keryell, Nicolas Paris