Sciweavers

7986 search results - page 1486 / 1598
» Computational Science and its Applications
Sort
View
KDD
2006
ACM
113views Data Mining» more  KDD 2006»
16 years 7 months ago
A new efficient probabilistic model for mining labeled ordered trees
Mining frequent patterns is a general and important issue in data mining. Complex and unstructured (or semi-structured) datasets have appeared in major data mining applications, i...
Kosuke Hashimoto, Kiyoko F. Aoki-Kinoshita, Nobuhi...
178
Voted
KDD
2001
ACM
118views Data Mining» more  KDD 2001»
16 years 7 months ago
Infominer: mining surprising periodic patterns
In this paper, we focus on mining surprising periodic patterns in a sequence of events. In many applications, e.g., computational biology, an infrequent pattern is still considere...
Jiong Yang, Wei Wang 0010, Philip S. Yu
PEPM
2010
ACM
16 years 3 months ago
Optimizing relational algebra operations using generic equivalence discriminators and lazy products
We show how to efficiently evaluate generic map-filter-product queries, generalizations of select-project-join (SPJ) queries in relational algebra, based on a combination of two...
Fritz Henglein
HRI
2010
ACM
16 years 1 months ago
Lead me by the hand: evaluation of a direct physical interface for nursing assistant robots
—When a user is in close proximity to a robot, physical contact becomes a potentially valuable channel for communication. People often use direct physical contact to guide a pers...
Tiffany L. Chen, Charles C. Kemp
AICCSA
2007
IEEE
124views Hardware» more  AICCSA 2007»
16 years 1 months ago
The Maximum Common Subgraph Problem: Faster Solutions via Vertex Cover
In the maximum common subgraph (MCS) problem, we are given a pair of graphs and asked to find the largest induced subgraph common to them both. With its plethora of applications,...
Faisal N. Abu-Khzam, Nagiza F. Samatova, Mohamad A...
« Prev « First page 1486 / 1598 Last » Next »