417 search results - page 35 / 84 » Some Theory for Generalized Boosting Algorithms |
DAC
2003
ACM
14 years 10 months ago
2003
ACM
In some cases, minimum Sum-Of-Products (SOP) expressions of Boolean functions can be derived by detecting decomposition and observing the functional properties such as unateness, ...
MYCRYPT
2005
Springer
14 years 2 months ago
2005
Springer
Recently, some collisions have been exposed for a variety of cryptographic hash functions [20,21] including some of the most widely used today. Many other hash functions using simi...
INFOCOM
2007
IEEE
14 years 3 months ago
2007
IEEE
— Many network operators offer some type of tiered service, in which users may select only from a small set of service levels (tiers). Such a service has the potential to simplif...
ISAAC
2007
Springer
14 years 3 months ago
2007
Springer
We introduces the umodules, a generalization of the notion of graph module. The theory we develop captures among others undirected graphs, tournaments, digraphs, and 2−structures...
CIKM
2009
Springer
14 years 1 months ago
2009
Springer
Tree patterns represent important fragments of XPath. In this paper, we show that some classes of tree patterns exhibit such a property that, given a finite number of tree patter...