Sciweavers

991 search results - page 123 / 199
» Linear Segmentation and Segment Significance
Sort
View
STACS
1992
Springer
15 years 2 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...
CVPR
2008
IEEE
15 years 12 months ago
From appearance to context-based recognition: Dense labeling in small images
Traditionally, object recognition is performed based solely on the appearance of the object. However, relevant information also exists in the scene surrounding the object. As supp...
Devi Parikh, C. Lawrence Zitnick, Tsuhan Chen
MOBIHOC
2008
ACM
15 years 9 months ago
Strong barrier coverage of wireless sensor networks
Constructing sensor barriers to detect intruders crossing a randomly-deployed sensor network is an important problem. Early results have shown how to construct sensor barriers to ...
Benyuan Liu, Olivier Dousse, Jie Wang, Anwar Saipu...
BMCBI
2008
103views more  BMCBI 2008»
14 years 10 months ago
The VirusBanker database uses a Java program to allow flexible searching through Bunyaviridae sequences
Background: Viruses of the Bunyaviridae have segmented negative-stranded RNA genomes and several of them cause significant disease. Many partial sequences have been obtained from ...
Mathieu Fourment, Mark J. Gibbs
CCR
2010
179views more  CCR 2010»
14 years 10 months ago
An argument for increasing TCP's initial congestion window
TCP flows start with an initial congestion window of at most four segments or approximately 4KB of data. Because most Web transactions are short-lived, the initial congestion wind...
Nandita Dukkipati, Tiziana Refice, Yuchung Cheng, ...