Sciweavers

67 search results - page 4 / 14
» Finding Even Cycles Even Faster
Sort
View
PVLDB
2008
107views more  PVLDB 2008»
13 years 5 months ago
Finding relevant patterns in bursty sequences
Sequence data is ubiquitous and finding frequent sequences in a large database is one of the most common problems when analyzing sequence data. Unfortunately many sources of seque...
Alexander Lachmann, Mirek Riedewald
BCB
2010
156views Bioinformatics» more  BCB 2010»
13 years 1 months ago
RepFrag: a graph based method for finding repeats and transposons from fragmented genomes
Growing sequencing and assembly efforts have been met by the advances in high throughput machines. However, the presence of massive amounts of repeats and transposons complicates ...
Nirmalya Bandyopadhyay, A. Mark Settles, Tamer Kah...
SIGIR
2006
ACM
13 years 12 months ago
Type less, find more: fast autocompletion search with a succinct index
We consider the following full-text search autocompletion feature. Imagine a user of a search engine typing a query. Then with every letter being typed, we would like an instant d...
Holger Bast, Ingmar Weber
IPPS
1996
IEEE
13 years 10 months ago
Practical Parallel Algorithms for Dynamic Data Redistribution, Median Finding, and Selection
A common statistical problem is that of nding the median element in a set of data. This paper presents a fastand portable parallel algorithm for nding the median given a set of el...
David A. Bader, Joseph JáJá
INFOCOM
2011
IEEE
12 years 9 months ago
Smart sleep: Sleep more to reduce delay in duty-cycled wireless sensor networks
A simple random walk (SRW) has been considered as an effective forwarding method for many applications in wireless sensor networks (WSNs) due to its desirable properties. However...
Chul-Ho Lee, Do Young Eun