417 search results - page 50 / 84 » Some Theory for Generalized Boosting Algorithms |
FOCS
2006
IEEE
14 years 3 months ago
2006
IEEE
Given an undirected hypergraph and a subset of vertices S ⊆ V with a specified root vertex r ∈ S, the STEINER ROOTED-ORIENTATION problem is to find an orientation of all the...
DIALM
2003
ACM
14 years 2 months ago
2003
ACM
A common way of storing spatio-temporal information about mobile devices is in the form of a 3D (2D geography + time) trajectory. We argue that when cellular phones and Personal D...
KCAP
2003
ACM
14 years 2 months ago
2003
ACM
In this paper we describe a generic library of problemsolving methods (PSMs) for scheduling applications. Although, some attempts have been made in the past at developing librarie...
CISSE
2008
Springer
13 years 11 months ago
2008
Springer
: Many real world problems appear naturally as constraints satisfaction problems (CSP), for which very efficient algorithms are known. Most of these involve the combination of two ...
KDD
2005
ACM
14 years 9 months ago
2005
ACM
We present an algorithm for mining tree-shaped patterns in a large graph. Novel about our class of patterns is that they can contain constants, and can contain existential nodes w...