2446 search results - page 77 / 490 » Where am I |
CINQ
2004
Springer
14 years 3 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...
DAM
2007
13 years 10 months ago
2007
Given a graph G = (V, E) with a cost function c(S) ≥ 0 ∀S ⊆ V , we want to represent all possible min-cut values between pairs of vertices i and j. We consider also the spec...
JSC
2008
13 years 10 months ago
2008
Let k be a field of characteristic zero, n any positive integer and let n be the derivation n i=1 Xi Yi of the polynomial ring k[X1, . . . , Xn, Y1, . . . , Yn] in 2n variables o...
QUESTA
2008
13 years 9 months ago
2008
We consider a discrete-time tree network of polling servers where all packets are routed to the same node (called node 0), from which they leave the network. All packets have unit...
PERCOM
2009
ACM
14 years 4 months ago
2009
ACM
—In this paper, an information grouping paradigm for QoI in sensor networks is introduced. First, a definition of QoI is presented by analyzing the ITU’s definition of QoS. T...