Sciweavers

917 search results - page 124 / 184
» Comparison of Data Structures for Computing Formal Concepts
Sort
View
CPM
2006
Springer
112views Combinatorics» more  CPM 2006»
15 years 1 months ago
Local Alignment of RNA Sequences with Arbitrary Scoring Schemes
Abstract. Local similarity is an important tool in comparative analysis of biological sequences, and is therefore well studied. In particular, the Smith-Waterman technique and its ...
Rolf Backofen, Danny Hermelin, Gad M. Landau, Oren...
ICDCS
2010
IEEE
15 years 1 months ago
New Algorithms for Planning Bulk Transfer via Internet and Shipping Networks
—Cloud computing is enabling groups of academic collaborators, groups of business partners, etc., to come together in an ad-hoc manner. This paper focuses on the group-based data...
Brian Cho, Indranil Gupta
DCC
2008
IEEE
15 years 9 months ago
On Self-Indexing Images - Image Compression with Added Value
Recent advances in compressed data structures have led to the new concept of self-indexing; it is possible to represent a sequence of symbols compressed in a form that enables fas...
Veli Mäkinen, Gonzalo Navarro
IPPS
2003
IEEE
15 years 3 months ago
Fast Online Task Placement on FPGAs: Free Space Partitioning and 2D-Hashing
Partial reconfiguration allows for mapping and executing several tasks on an FPGA during runtime. Multitasking on FPGAs raises a number of questions on the management of the reco...
Herbert Walder, Christoph Steiger, Marco Platzner
ISMB
1996
14 years 11 months ago
Discovering Empirically Conserved Amino Acid Substitution Groups in Databases of Protein Families
Thispaperintroducesa methodfor identifyingempirically conservedaminoacid substitution groups.In contrast with existing approachesthat viewaminoacid substitution as a pairwisepheno...
Thomas D. Wu, Douglas L. Brutlag