Sciweavers

97 search results - page 14 / 20
» Pattern Matching and Pattern Discovery Algorithms for Protei...
Sort
View
FLAIRS
2010
13 years 11 months ago
Handling of Numeric Ranges for Graph-Based Knowledge Discovery
Nowadays, graph-based knowledge discovery algorithms do not consider numeric attributes (they are discarded in the preprocessing step, or they are treated as alphanumeric values w...
Oscar E. Romero, Jesus A. Gonzalez, Lawrence B. Ho...
WOA
2003
13 years 10 months ago
Using a Properties Based Naming System in Mobile Agents Environments for Pervasive Computing
— Mobile Agents model is widely accepted as a good solution to simplify the coordination in a complex and distributed environment. Pervasive computing, presents many issues regar...
Fabio Tarantino, Alessio Ravani, Mario Zambrini
CAL
2002
13 years 8 months ago
Worst-case Traffic for Oblivious Routing Functions
This paper presents an algorithm to find a worst-case traffic pattern for any oblivious routing algorithm on an arbitrary interconnection network topology. The linearity of channe...
Brian Towles, William J. Dally
KDD
2004
ACM
182views Data Mining» more  KDD 2004»
14 years 9 months ago
Rotation invariant distance measures for trajectories
For the discovery of similar patterns in 1D time-series, it is very typical to perform a normalization of the data (for example a transformation so that the data follow a zero mea...
Michail Vlachos, Dimitrios Gunopulos, Gautam Das
CORR
2012
Springer
222views Education» more  CORR 2012»
12 years 4 months ago
A limit process for partial match queries in random quadtrees
We consider the problem of recovering items matching a partially specified pattern in multidimensional trees (quad trees and k-d trees). We assume the classical model where the d...
Nicolas Broutin, Ralph Neininger, Henning Sulzbach