Sciweavers

1709 search results - page 163 / 342
» Comparing the Performance of Database Selection Algorithms
Sort
View
IPPS
1997
IEEE
15 years 10 months ago
Control Schemes in a Generalized Utility for Parallel Branch-and-Bound Algorithms
Branch-and-bound algorithms are general methods applicable to various combinatorial optimization problems and parallelization is one of the most hopeful methods to improve these a...
Yuji Shinano, Kenichi Harada, Ryuichi Hirabayashi
CVPR
2010
IEEE
16 years 1 months ago
Automatic Image Annotation Using Group Sparsity
Automatically assigning relevant text keywords to images is an important problem. Many algorithms have been proposed in the past decade and achieved good performance. Efforts have...
Shaoting Zhang, Junzhou Huang, Yuchi Huang, Yang Y...
WWW
2004
ACM
16 years 7 months ago
On mining webclick streams for path traversal patterns
Mining user access patterns from a continuous stream of Web-clicks presents new challenges over traditional Web usage mining in a large static Web-click database. Modeling user ac...
Hua-Fu Li, Suh-Yin Lee, Man-Kwan Shan
ICCAD
2004
IEEE
158views Hardware» more  ICCAD 2004»
16 years 3 months ago
DAOmap: a depth-optimal area optimization mapping algorithm for FPGA designs
In this paper we study the technology mapping problem for FPGA architectures to minimize chip area, or the total number of lookup tables (LUTs) of the mapped design, under the chi...
Deming Chen, Jason Cong
ICMCS
2005
IEEE
119views Multimedia» more  ICMCS 2005»
15 years 12 months ago
Polyphonic Audio Key Finding Using the Spiral Array CEG Algorithm
Key finding is an integral step in content-based music indexing and retrieval. In this paper, we present an O(n) real-time algorithm for determining key from polyphonic audio. We ...
Ching-Hua Chuan, Elaine Chew