Sciweavers

7259 search results - page 1413 / 1452
» From Fields to Trees
Sort
View
PPOPP
2009
ACM
14 years 8 months ago
An efficient transactional memory algorithm for computing minimum spanning forest of sparse graphs
Due to power wall, memory wall, and ILP wall, we are facing the end of ever increasing single-threaded performance. For this reason, multicore and manycore processors are arising ...
Seunghwa Kang, David A. Bader
KDD
2008
ACM
207views Data Mining» more  KDD 2008»
14 years 8 months ago
Active learning with direct query construction
Active learning may hold the key for solving the data scarcity problem in supervised learning, i.e., the lack of labeled data. Indeed, labeling data is a costly process, yet an ac...
Charles X. Ling, Jun Du
KDD
2007
ACM
566views Data Mining» more  KDD 2007»
14 years 8 months ago
IMDS: intelligent malware detection system
The proliferation of malware has presented a serious threat to the security of computer systems. Traditional signature-based antivirus systems fail to detect polymorphic and new, ...
Yanfang Ye, Dingding Wang, Tao Li, Dongyi Ye
RECOMB
2006
Springer
14 years 8 months ago
A Parameterized Algorithm for Protein Structure Alignment
This paper proposes a parameterized algorithm for aligning two protein structures, in the case where one protein structure is represented by a contact map graph and the other by a ...
Jinbo Xu, Feng Jiao, Bonnie Berger
RECOMB
2002
Springer
14 years 8 months ago
Monotony of surprise and large-scale quest for unusual words
The problem of characterizing and detecting recurrent sequence patterns such as substrings or motifs and related associations or rules is variously pursued in order to compress da...
Alberto Apostolico, Mary Ellen Bock, Stefano Lonar...
« Prev « First page 1413 / 1452 Last » Next »