Sciweavers

5100 search results - page 999 / 1020
» The Linear Complexity of a Graph
Sort
View
KDD
2010
ACM
199views Data Mining» more  KDD 2010»
15 years 10 months ago
Online discovery and maintenance of time series motifs
The detection of repeated subsequences, time series motifs, is a problem which has been shown to have great utility for several higher-level data mining algorithms, including clas...
Abdullah Mueen, Eamonn J. Keogh
CASC
2006
Springer
128views Mathematics» more  CASC 2006»
15 years 10 months ago
New Domains for Applied Quantifier Elimination
We address various aspects of our computer algebra-based computer logic system redlog. There are numerous examples in the literature for successful applications of redlog to practi...
Thomas Sturm
CMSB
2006
Springer
15 years 10 months ago
Type Inference in Systems Biology
Type checking and type inference are important concepts and methods of programming languages and software engineering. Type checking is a way to ensure some level of consistency, d...
François Fages, Sylvain Soliman
CCS
2001
ACM
15 years 10 months ago
A verifiable secret shuffle and its application to e-voting
We present a mathematical construct which provides a cryptographic protocol to verifiably shuffle a sequence of k modular integers, and discuss its application to secure, universa...
C. Andrew Neff
SIGGRAPH
1995
ACM
15 years 10 months ago
A signal processing approach to fair surface design
In this paper we describe a new tool for interactive free-form fair surface design. By generalizing classical discrete Fourier analysis to two-dimensional discrete surface signals...
Gabriel Taubin