Sciweavers

9842 search results - page 1604 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
WWW
2004
ACM
16 years 7 months ago
Specifying Semantic Email Processes
Prior work has shown that semantic email processes (SEPs) can be an effective tool for automating emailmediated tasks that are currently performed manually in a tedious, time-cons...
Luke McDowell, Oren Etzioni, Alon Y. Halevy
RECOMB
2009
Springer
16 years 7 months ago
Searching Protein 3-D Structures in Linear Time
Finding similar structures from 3-D structure databases of proteins is becoming more and more important issue in the post-genomic molecular biology. To compare 3-D structures of tw...
Tetsuo Shibuya
CADE
2009
Springer
16 years 7 months ago
Real World Verification
Scalable handling of real arithmetic is a crucial part of the verification of hybrid systems, mathematical algorithms, and mixed analog/digital circuits. Despite substantial advanc...
André Platzer, Jan-David Quesel, Philipp R&...
PODC
2009
ACM
16 years 7 months ago
A distributed polylogarithmic time algorithm for self-stabilizing skip graphs
Peer-to-peer systems rely on scalable overlay networks that enable efficient routing between its members. Hypercubic topologies facilitate such operations while each node only nee...
Riko Jacob, Andréa W. Richa, Christian Sche...
KDD
2009
ACM
192views Data Mining» more  KDD 2009»
16 years 7 months ago
Time series shapelets: a new primitive for data mining
Classification of time series has been attracting great interest over the past decade. Recent empirical evidence has strongly suggested that the simple nearest neighbor algorithm ...
Lexiang Ye, Eamonn J. Keogh
« Prev « First page 1604 / 1969 Last » Next »