Sciweavers

3575 search results - page 267 / 715
» Structured motifs search
Sort
View
ISCA
2008
IEEE
136views Hardware» more  ISCA 2008»
15 years 6 months ago
A Randomized Queueless Algorithm for Breadth-First Search
First Come First Served is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems [28, 11], scheduling web ...
K. Subramani, Kamesh Madduri
141
Voted
CCE
2005
15 years 6 months ago
Computer-aided molecular design using Tabu search
A detailed implementation of the Tabu Search (TS) algorithm for computer-aided molecular design (CAMD) of transition metal catalysts is presented in this paper. Previous CAMD rese...
Bao Lin, Sunitha Chavali, Kyle V. Camarda, David C...
SIGMOD
2010
ACM
166views Database» more  SIGMOD 2010»
15 years 1 months ago
FAST: fast architecture sensitive tree search on modern CPUs and GPUs
In-memory tree structured index search is a fundamental database operation. Modern processors provide tremendous computing power by integrating multiple cores, each with wide vect...
Changkyu Kim, Jatin Chhugani, Nadathur Satish, Eri...
ICDAR
2011
IEEE
14 years 6 months ago
Fast Key-Word Searching via Embedding and Active-DTW
—In this paper we present a novel approach for fast search of handwritten Arabic word-parts within large lexicons. The algorithm runs through three steps to achieve the required ...
Raid Saabni, Alex Bronstein
ICDE
2007
IEEE
219views Database» more  ICDE 2007»
16 years 8 months ago
Efficient Keyword Search Across Heterogeneous Relational Databases
Keyword search is a familiar and potentially effective way to find information of interest that is "locked" inside relational databases. Current work has generally assum...
Mayssam Sayyadian, Hieu LeKhac, AnHai Doan, Luis G...