Sciweavers

835 search results - page 62 / 167
» An algorithmic approach to event summarization
Sort
View
RECOMB
2006
Springer
15 years 10 months ago
A Parsimony Approach to Genome-Wide Ortholog Assignment
The assignment of orthologous genes between a pair of genomes is a fundamental and challenging problem in comparative genomics, since many computational methods for solving various...
Zheng Fu, Xin Chen, Vladimir Vacic, Peng Nan, Yang...
KDD
2010
ACM
217views Data Mining» more  KDD 2010»
14 years 8 months ago
Mining program workflow from interleaved traces
Successful software maintenance is becoming increasingly critical due to the increasing dependence of our society and economy on software systems. One key problem of software main...
Jian-Guang Lou, Qiang Fu, Shengqi Yang, Jiang Li, ...
ISBI
2007
IEEE
15 years 4 months ago
Space-Time Sparsity Regularization for the Magnetoencephalography Inverse Problem
The concept of “Space-Time Sparsity” (STS) penalization is introduced for solving the magnetoencephalography (MEG) inverse problem. The STS approach assumes that events of int...
Andrew K. Bolstad, Barry D. Van Veen, Robert D. No...
IWIA
2003
IEEE
15 years 3 months ago
Intrusion Detection Testing and Benchmarking Methodologies
— The ad-hoc methodology that is prevalent in today’s testing and evaluation of network intrusion detection algorithms and systems makes it difficult to compare different algor...
Nicholas Athanasiades, Randal Abler, John G. Levin...
SIBGRAPI
1999
IEEE
15 years 2 months ago
Deterministic Texture Analysis and Synthesis Using Tree Structure Vector Quantization
Texture analysis and synthesis is very important for computer graphics, vision, and image processing. This paper describes an algorithm which can produce new textures with a matchi...
Li-Yi Wei