1915 search results - page 304 / 383 » Computing LTS Regression for Large Data Sets |
119
click to vote
ICDM
2006
IEEE
15 years 3 months ago
2006
IEEE
How closely related are two nodes in a graph? How to compute this score quickly, on huge, disk-resident, real graphs? Random walk with restart (RWR) provides a good relevance scor...
PAKDD
2009
ACM
15 years 2 months ago
2009
ACM
Abstract. Detecting abnormal event from video sequences is an important problem in computer vision and pattern recognition and a large number of algorithms have been devised to tac...
INAP
2001
Springer
15 years 2 months ago
2001
Springer
This paper presents new techniques for focusing the discoveryof frequent itemsets within large, dense datasets containing highly frequent items. The existence of highly frequent i...
100
click to vote
EUROGP
2007
Springer
15 years 1 months ago
2007
Springer
The conversion and extension of the Incremental Pareto-Coevolution Archive algorithm (IPCA) into the domain of Genetic Programming classification is presented. In particular, the ...
DASFAA
2008
IEEE
14 years 11 months ago
2008
IEEE
Recently, great efforts have been dedicated to researches on the management of large-scale graph-based data, where node disjoint subgraph homeomorphism relation between graphs has ...