Sciweavers

377 search results - page 72 / 76
» A Fast Heuristic Algorithm for a Probe Mapping Problem
Sort
View
ISCAS
2005
IEEE
129views Hardware» more  ISCAS 2005»
14 years 2 months ago
A reconfigurable architecture for scanning biosequence databases
—Unknown protein sequences are often compared to a set of known sequences (a database scan) to detect functional similarities. Even though efficient dynamic programming algorithm...
Timothy F. Oliver, Bertil Schmidt, Douglas L. Mask...
ANNPR
2008
Springer
13 years 10 months ago
Patch Relational Neural Gas - Clustering of Huge Dissimilarity Datasets
Clustering constitutes an ubiquitous problem when dealing with huge data sets for data compression, visualization, or preprocessing. Prototype-based neural methods such as neural g...
Alexander Hasenfuss, Barbara Hammer, Fabrice Rossi
AAAI
1998
13 years 10 months ago
Modeling Web Sources for Information Integration
The Web is based on a browsing paradigm that makes it di cult to retrieve and integrate data from multiple sites. Today, the only way to do this is to build specialized applicatio...
Craig A. Knoblock, Steven Minton, José Luis...
EDBT
2008
ACM
161views Database» more  EDBT 2008»
14 years 8 months ago
Load distribution of analytical query workloads for database cluster architectures
Enterprises may have multiple database systems spread across the organization for redundancy or for serving different applications. In such systems, query workloads can be distrib...
Thomas Phan, Wen-Syan Li
SI3D
2006
ACM
14 years 2 months ago
Abstract shade trees
Shade Trees Morgan McGuire George Stathis Hanspeter Pfister Shriram Krishnamurthi Brown University Harvard Extension School MERL Brown University As GPU-powered special effects be...
Morgan McGuire, George Stathis, Hanspeter Pfister,...