Sciweavers

1814 search results - page 109 / 363
» Improved Results on Geometric Hitting Set Problems
Sort
View
ALMOB
2006
155views more  ALMOB 2006»
15 years 6 months ago
Refining motifs by improving information content scores using neighborhood profile search
The main goal of the motif finding problem is to detect novel, over-represented unknown signals in a set of sequences (e.g. transcription factor binding sites in a genome). The mo...
Chandan K. Reddy, Yao-Chung Weng, Hsiao-Dong Chian...
SBACPAD
2005
IEEE
176views Hardware» more  SBACPAD 2005»
15 years 11 months ago
Analyzing and Improving Clustering Based Sampling for Microprocessor Simulation
The time required to simulate a complete benchmark program using the cycle-accurate model of a microprocessor can be prohibitively high. One of the proposed methodologies, represe...
Yue Luo, Ajay Joshi, Aashish Phansalkar, Lizy Kuri...
147
Voted
MMDB
2003
ACM
94views Multimedia» more  MMDB 2003»
15 years 11 months ago
Improving image retrieval effectiveness via multiple queries
Conventional approaches to image retrieval are based on the assumption that relevant images are physically near the query image in some feature space. This is the basis of the clu...
Xiangyu Jin, James C. French
CVPR
2011
IEEE
14 years 9 months ago
A Global Optimization Approach to Robust Multi-Model Fitting
We present a novel Quadratic Program (QP) formulation for robust multi-model fitting of geometric structures in vision data. Our objective function enforces both the fidelity of...
Jin Yu, Tat-Jun Chin, David Suter
AAIM
2005
Springer
110views Algorithms» more  AAIM 2005»
15 years 11 months ago
Dynamically Updating the Exploiting Parameter in Improving Performance of Ant-Based Algorithms
Abstract. The utilization of pseudo-random proportional rule to balance between the exploitation and exploration of the search process was shown in Ant Colony System (ACS) algorith...
Hoang Trung Dinh, Abdullah Al Mamun, Hieu T. Dinh