520 search results - page 63 / 104 » Subset Counting in Trees |
COCOA
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. Many combinatorial optimization problems can be formulated as 0/1 integer programs (0/1 IPs). The investigation of the structure of these problems raises the following ta...
CINQ
2004
Springer
14 years 1 months ago
2004
Springer
Mining Frequent Itemsets is the core operation of many data mining algorithms. This operation however, is very data intensive and sometimes produces a prohibitively large output. I...
ISCA
2003
IEEE
14 years 1 months ago
2003
IEEE
Clustered microarchitectures are an attractive alternative to large monolithic superscalar designs due to their potential for higher clock rates in the face of increasingly wire-d...
ICVGIP
2008
13 years 9 months ago
2008
A video from a moving camera produces different number of observations of different scene areas. We can construct an attention map of the scene by bringing the frames to a common ...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
We show that it is equivalent, for certain sets of finite graphs, to be definable in CMS (counting monadic second-order, a natural extension of monoadic second-order logic), and t...