417 search results - page 73 / 84 » Some Theory for Generalized Boosting Algorithms |
JSYML
2010
13 years 2 months ago
2010
A set A of vertices of a graph G is called d-scattered in G if no two d-neighborhoods of (distinct) vertices of A intersect. In other words, A is d-scattered if no two distinct ver...
WWW
2006
ACM
14 years 8 months ago
2006
ACM
XML is fast becoming the standard format to store, exchange and publish over the web, and is getting embedded in applications. Two challenges in handling XML are its size (the XML...
GECCO
2009
Springer
14 years 2 months ago
2009
Springer
The need for a stopping criterion in MOEA’s is a repeatedly mentioned matter in the domain of MOOP’s, even though it is usually left aside as secondary, while stopping criteri...
PODS
1995
ACM
13 years 11 months ago
1995
ACM
Databases are often incomplete because of the presence of disjunctive information, due to con icts, partial knowledge and other reasons. Queries against such databases often ask q...
PODS
2011
ACM
12 years 10 months ago
2011
ACM
Database queries can be broadly classified into two categories: reporting queries and aggregation queries. The former retrieves a collection of records from the database that mat...