2434 search results - page 265 / 487 » Algorithmic Randomness of Closed Sets |
133
click to vote
SODA
2010
ACM
16 years 1 months ago
2010
ACM
There has been great interest in deciding whether a combinatorial structure satisfies some property, or in estimating the value of some numerical function associated with this com...
210
click to vote
ECAI
2008
Springer
15 years 5 months ago
2008
Springer
Many ensemble methods, such as Bagging, Boosting, Random Forest, etc, have been proposed and widely used in real world applications. Some of them are better than others on noisefre...
125
click to vote
JSYML
2010
14 years 10 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...
100
click to vote
EDBT
2009
ACM
15 years 10 months ago
2009
ACM
Given a set Q of keywords, conventional keyword search (KS) returns a set of tuples, each of which (i) is obtained from a single relation, or by joining multiple relations, and (i...
127
click to vote
CDC
2010
IEEE
14 years 11 months ago
2010
IEEE
Abstract-- We consider optimal experiment design for parametric prediction error system identification of linear timeinvariant systems in closed loop. The optimisation is performed...