Sciweavers

306 search results - page 51 / 62
» Mining tree queries in a graph
Sort
View
GECCO
2007
Springer
155views Optimization» more  GECCO 2007»
14 years 2 months ago
Towards clustering with XCS
This paper presents a novel approach to clustering using an accuracy-based Learning Classifier System. Our approach achieves this by exploiting the generalization mechanisms inher...
Kreangsak Tamee, Larry Bull, Ouen Pinngern
CORR
2011
Springer
208views Education» more  CORR 2011»
13 years 2 months ago
GRASP and path-relinking for Coalition Structure Generation
In Artificial Intelligence with Coalition Structure Generation (CSG) one refers to those cooperative complex problems that require to find an optimal partition, maximising a soci...
Nicola Di Mauro, Teresa Maria Altomare Basile, Ste...
WSDM
2009
ACM
191views Data Mining» more  WSDM 2009»
14 years 2 months ago
Generating labels from clicks
The ranking function used by search engines to order results is learned from labeled training data. Each training point is a (query, URL) pair that is labeled by a human judge who...
Rakesh Agrawal, Alan Halverson, Krishnaram Kenthap...

Book
688views
15 years 6 months ago
Database Management Systems
A set of presentations covering the book, which includes the following topics ER Model and Conceptual Design, The Relational Model and SQL DDL, Relational Algebra, SQL, Database Ap...
Raghu Ramakrishnan, Johannes Gehrke
WADS
1993
Springer
110views Algorithms» more  WADS 1993»
13 years 12 months ago
A Dynamic Separator Algorithm
Our work is based on the pioneering work in sphere separators done by Miller, Teng, Vavasis et al, [8, 12], who gave efficient static (fixed input) algorithms for finding sphere ...
Deganit Armon, John H. Reif