1640 search results - page 211 / 328 » Conditional Independence Trees |
JMLR
2010
13 years 3 months ago
2010
In this paper we propose a new algorithm for learning polyhedral classifiers. In contrast to existing methods for learning polyhedral classifier which solve a constrained optimiza...
SIAMDM
2010
13 years 3 months ago
2010
The following problem was introduced by Marcin Krzywkowski as a generalization of a problem of Todd Ebert. After initially coordinating a strategy, n players each occupy a differe...
ACL
2011
13 years 15 days ago
2011
Nested event structures are a common occurrence in both open domain and domain specific extraction tasks, e.g., a “crime” event can cause a “investigation” event, which c...
LCN
2007
IEEE
14 years 3 months ago
2007
IEEE
—Multicasting has not been widely adopted until now, due to lack of access control over the group members. The Authentication, Authorization and Accounting (AAA) protocols are be...
COCOON
2007
Springer
14 years 3 months ago
2007
Springer
An r-component connected coloring of a graph is a coloring of the vertices so that each color class induces a subgraph having at most r connected components. The concept has been w...