Sciweavers

1786 search results - page 145 / 358
» The Structure of Factor Oracles
Sort
View
STACS
1992
Springer
15 years 10 months ago
Speeding Up Two String-Matching Algorithms
We show how to speed up two string-matching algorithms: the Boyer-Moore algorithm (BM algorithm), and its version called here the reverse factor algorithm (RF algorithm). The RF al...
Maxime Crochemore, Thierry Lecroq, Artur Czumaj, L...
RECSYS
2010
ACM
15 years 6 months ago
Collaborative filtering via euclidean embedding
Recommendation systems suggest items based on user preferences. Collaborative filtering is a popular approach in which recommending is based on the rating history of the system. O...
Mohammad Khoshneshin, W. Nick Street
BMCBI
2008
110views more  BMCBI 2008»
15 years 6 months ago
Determining significance of pairwise co-occurrences of events in bursty sequences
Background: Event sequences where different types of events often occur close together arise, e.g., when studying potential transcription factor binding sites (TFBS, events) of ce...
Niina Haiminen, Heikki Mannila, Evimaria Terzi
BMCBI
2007
99views more  BMCBI 2007»
15 years 6 months ago
Statistical significance of cis-regulatory modules
Background: It is becoming increasingly important for researchers to be able to scan through large genomic regions for transcription factor binding sites or clusters of binding si...
Dustin E. Schones, Andrew D. Smith, Michael Q. Zha...
ICPR
2004
IEEE
16 years 7 months ago
Perceptual Grouping for Contour Extraction
This paper describes an algorithm that efficiently groups line segments into perceptually salient contours in complex images. A measure of affinity between pairs of lines is used ...
Francisco J. Estrada, Allan D. Jepson