Sciweavers

2009 search results - page 101 / 402
» Dense Interest Points
Sort
View
BERTINORO
2005
Springer
14 years 1 months ago
Self-Aware Software - Will It Become a Reality?
The possibility of building self-aware software fascinated computer scientist since the beginning of computer science. Research in AI, and in particular on software agents, agent s...
Péter András, Bruce G Charlton
ESA
2005
Springer
114views Algorithms» more  ESA 2005»
14 years 1 months ago
Unbalanced Graph Cuts
We introduce the Minimum-size bounded-capacity cut (MinSBCC) problem, in which we are given a graph with an identified source and seek to find a cut minimizing the number of node...
Ara Hayrapetyan, David Kempe, Martin Pál, Z...
DAWAK
2004
Springer
14 years 1 months ago
A Tree Partitioning Method for Memory Management in Association Rule Mining
All methods of association rule mining require the frequent sets of items, that occur together sufficiently often to be the basis of potentially interesting rules, to be first com...
Shakil Ahmed, Frans Coenen, Paul H. Leng
CVPR
2010
IEEE
14 years 1 months ago
Motion Fields to Predict Play Evolution in Dynamic Sport Scenes
Videos of multi-player team sports provide a challenging domain for dynamic scene analysis. Player actions and interactions are complex as they are driven by many factors, such as...
Kihwan Kim, Matthias Grundmann, Ariel Shamir, Iain...
AUSDM
2006
Springer
118views Data Mining» more  AUSDM 2006»
13 years 12 months ago
Efficiently Identifying Exploratory Rules' Significance
How to efficiently discard potentially uninteresting rules in exploratory rule discovery is one of the important research foci in data mining. Many researchers have presented algor...
Shiying Huang, Geoffrey I. Webb