Sciweavers

249 search results - page 31 / 50
» Finding Patterns in Given Intervals
Sort
View
TCS
2008
13 years 8 months ago
Competitive graph searches
We exemplify an optimization criterion for divide-and-conquer algorithms with a technique called generic competitive graph search. The technique is then applied to solve two probl...
Binh-Minh Bui-Xuan, Michel Habib, Christophe Paul
DFT
2003
IEEE
64views VLSI» more  DFT 2003»
14 years 1 months ago
Hybrid BIST Time Minimization for Core-Based Systems with STUMPS Architecture
1 This paper presents a solution to the test time minimization problem for core-based systems that contain sequential cores with STUMPS architecture. We assume a hybrid BIST approa...
Gert Jervan, Petru Eles, Zebo Peng, Raimund Ubar, ...
JBI
2002
105views Bioinformatics» more  JBI 2002»
13 years 8 months ago
Information extraction for enhanced access to disease outbreak reports
Document search is generally based on individual terms in the document. However, for collections within limited domains it is possible to provide more powerful access tools. This ...
Ralph Grishman, Silja Huttunen, Roman Yangarber
ISPAN
1997
IEEE
14 years 19 days ago
RMESH Algorithms for Parallel String Matching
Abstract- String matching problem received much attention over the years due to its importance in various applications such as text/file comparison, DNA sequencing, search engines,...
Hsi-Chieh Lee, Fikret Erçal
MEDIAFORENSICS
2010
13 years 10 months ago
Managing a large database of camera fingerprints
Sensor fingerprint is a unique noise-like pattern caused by slightly varying pixel dimensions and inhomogeneity of the silicon wafer from which the sensor is made. The fingerprint...
Miroslav Goljan, Jessica J. Fridrich, Tomás...