Sciweavers

3413 search results - page 209 / 683
» New Support Vector Algorithms
Sort
View
CPM
2007
Springer
167views Combinatorics» more  CPM 2007»
16 years 1 months ago
Deterministic Length Reduction: Fast Convolution in Sparse Data and Applications
In this paper a deterministic algorithm for the length reduction problem is presented. This algorithm enables a new tool for performing fast convolution in sparse data. While the ...
Amihood Amir, Oren Kapah, Ely Porat
FIMI
2004
123views Data Mining» more  FIMI 2004»
15 years 8 months ago
Surprising Results of Trie-based FIM Algorithms
Trie is a popular data structure in frequent itemset mining (FIM) algorithms. It is memory-efficient, and allows fast construction and information retrieval. Many trie-related tec...
Ferenc Bodon
WWW
2005
ACM
16 years 7 months ago
Web log mining with adaptive support thresholds
With the fast increase in Web activities, Web data mining has recently become an important research topic. However, most previous studies of mining path traversal patterns are bas...
Jian Chih Ou, Chang-Hung Lee, Ming-Syan Chen
CVPR
2007
IEEE
16 years 8 months ago
A Human Action Recognition System for Embedded Computer Vision Application
In this paper, we propose a human action recognition system suitable for embedded computer vision applications in security systems, human-computer interaction and intelligent envi...
Hongying Meng, Nick Pears, Chris Bailey
CICLING
2005
Springer
16 years 11 days ago
Incremental Information Extraction Using Tree-Based Context Representations
Abstract. The purpose of information extraction (IE) is to find desired pieces of information in natural language texts and store them in a form that is suitable for automatic pro...
Christian Siefkes