Sciweavers

1397 search results - page 244 / 280
» Application Performance of a Linux Cluster Using Converse
Sort
View
BMCBI
2002
131views more  BMCBI 2002»
13 years 7 months ago
Efficient Boolean implementation of universal sequence maps (bUSM)
Background: Recently, Almeida and Vinga offered a new approach for the representation of arbitrary discrete sequences, referred to as Universal Sequence Maps (USM), and discussed ...
John Schwacke, Jonas S. Almeida
ISPASS
2005
IEEE
14 years 1 months ago
Measuring Program Similarity: Experiments with SPEC CPU Benchmark Suites
Performance evaluation using only a subset of programs from a benchmark suite is commonplace in computer architecture research. This is especially true during early design space e...
Aashish Phansalkar, Ajay Joshi, Lieven Eeckhout, L...
SC
2003
ACM
14 years 26 days ago
A Million-Fold Speed Improvement in Genomic Repeats Detection
This paper presents a novel, parallel algorithm for generating top alignments. Top alignments are used for finding internal repeats in biological sequences like proteins and gene...
John W. Romein, Jaap Heringa, Henri E. Bal
ICCV
2007
IEEE
14 years 9 months ago
Classification of Weakly-Labeled Data with Partial Equivalence Relations
In many vision problems, instead of having fully labeled training data, it is easier to obtain the input in small groups, where the data in each group is constrained to be from th...
Sanjiv Kumar, Henry A. Rowley
WWW
2007
ACM
14 years 8 months ago
Identifying and discriminating between web and peer-to-peer traffic in the network core
Traffic classification is the ability to identify and categorize network traffic by application type. In this paper, we consider the problem of traffic classification in the netwo...
Jeffrey Erman, Anirban Mahanti, Martin F. Arlitt, ...