Sciweavers

3652 search results - page 199 / 731
» A study of query length
Sort
View
HPCC
2009
Springer
14 years 25 days ago
Load Scheduling Strategies for Parallel DNA Sequencing Applications
This paper studies a load scheduling strategy with nearoptimal processing time leveraging the computational characteristics of parallel DNA sequence alignment algorithms, specific...
Sudha Gunturu, Xiaolin Li, Laurence Tianruo Yang
SODA
2010
ACM
213views Algorithms» more  SODA 2010»
14 years 5 months ago
Regular Expression Matching with Multi-Strings
Regular expression matching is a key task (and often computational bottleneck) in a variety of software tools and applications. For instance, the standard grep and sed utilities, ...
Philip Bille, Mikkel Thorup
ICDE
2003
IEEE
120views Database» more  ICDE 2003»
14 years 9 months ago
Broadcasting Dependent Data for Ordered Queries without Replication in a Multi-Channel Mobile Environment
In several mobile applications, the data items broadcast are dependent upon one another. However, most prior studies on broadcasting dependent data mainly consider single broadcas...
Jiun-Long Huang, Ming-Syan Chen, Wen-Chih Peng
ICASSP
2008
IEEE
14 years 2 months ago
Query adaptative locality sensitive hashing
It is well known that high-dimensional nearest-neighbor retrieval is very expensive. Many signal processing methods suffer from this computing cost. Dramatic performance gains can...
Herve Jegou, Laurent Amsaleg, Cordelia Schmid, Pat...
ICALP
2005
Springer
14 years 1 months ago
Tight Lower Bounds for Query Processing on Streaming and External Memory Data
We study a clean machine model for external memory and stream processing. We show that the number of scans of the external data induces a strict hierarchy (as long as work space is...
Martin Grohe, Christoph Koch, Nicole Schweikardt