6045 search results - page 832 / 1209 » Computable Linearizations of Well-partial-orderings |
190
click to vote
KDD
2009
ACM
16 years 7 months ago
2009
ACM
Motivated by structural properties of the Web graph that support efficient data structures for in memory adjacency queries, we study the extent to which a large network can be com...
189
click to vote
MOBIHOC
2009
ACM
16 years 7 months ago
2009
ACM
In this paper, we propose a practical scheme, called Non-Binary Joint Network-Channel Decoding (NB-JNCD) for reliable communication in wireless networks. It seamlessly couples cha...
170
click to vote
KDD
2008
ACM
16 years 7 months ago
2008
ACM
In this paper, we propose a set of novel regression-based approaches to effectively and efficiently summarize frequent itemset patterns. Specifically, we show that the problem of ...
188
click to vote
KDD
2003
ACM
16 years 7 months ago
2003
ACM
Burst detection is the activity of finding abnormal aggregates in data streams. Such aggregates are based on sliding windows over data streams. In some applications, we want to mo...
160
click to vote
KDD
2002
ACM
16 years 7 months ago
2002
ACM
In this paper, we focus on methodology of finding a classifier with a minimal cost in presence of additional performance constraints. ROCCH analysis, where accuracy and cost are i...