Sciweavers

2512 search results - page 304 / 503
» Learning from Highly Structured Data by Decomposition
Sort
View
JPDC
2006
111views more  JPDC 2006»
15 years 4 months ago
Designing irregular parallel algorithms with mutual exclusion and lock-free protocols
Irregular parallel algorithms pose a significant challenge for achieving high performance because of the difficulty predicting memory access patterns or execution paths. Within an...
Guojing Cong, David A. Bader
ICCV
2009
IEEE
1363views Computer Vision» more  ICCV 2009»
16 years 9 months ago
Human Detection Using Partial Least Squares Analysis
Significant research has been devoted to detecting people in images and videos. In this paper we describe a human detection method that augments widely used edge-based features ...
William Robson Schwartz, Aniruddha Kembhavi, David...
HT
1991
ACM
15 years 7 months ago
Implementing Hypertext Database Relationships through Aggregations and Exceptions
In order to combine hypertext with database facilities, we show how to extract an effective storage structure from given instance relationships. The schema of the structure recogn...
Yoshinori Hara, Arthur M. Keller, Gio Wiederhold
KDD
2003
ACM
175views Data Mining» more  KDD 2003»
16 years 4 months ago
Time and sample efficient discovery of Markov blankets and direct causal relations
Data Mining with Bayesian Network learning has two important characteristics: under broad conditions learned edges between variables correspond to causal influences, and second, f...
Ioannis Tsamardinos, Constantin F. Aliferis, Alexa...
IJCNN
2007
IEEE
15 years 10 months ago
Agnostic Learning versus Prior Knowledge in the Design of Kernel Machines
Abstract— The optimal model parameters of a kernel machine are typically given by the solution of a convex optimisation problem with a single global optimum. Obtaining the best p...
Gavin C. Cawley, Nicola L. C. Talbot