Sciweavers

5995 search results - page 1075 / 1199
» Algorithmic Game Theory
Sort
View
130
Voted
MOBIHOC
2009
ACM
16 years 4 months ago
Delay and effective throughput of wireless scheduling in heavy traffic regimes: vacation model for complexity
Distributed scheduling algorithms for wireless ad hoc networks have received substantial attention over the last decade. The complexity levels of these algorithms span a wide spec...
Yung Yi, Junshan Zhang, Mung Chiang
MOBIHOC
2009
ACM
16 years 4 months ago
Fault tolerant target tracking in sensor networks
In this paper, we present a Gaussian mixture model based approach to capture the spatial characteristics of any target signal in a sensor network, and further propose a temporally...
Min Ding, Xiuzhen Cheng
KDD
2008
ACM
239views Data Mining» more  KDD 2008»
16 years 4 months ago
Mining adaptively frequent closed unlabeled rooted trees in data streams
Closed patterns are powerful representatives of frequent patterns, since they eliminate redundant information. We propose a new approach for mining closed unlabeled rooted trees a...
Albert Bifet, Ricard Gavaldà
KDD
2007
ACM
165views Data Mining» more  KDD 2007»
16 years 4 months ago
Finding low-entropy sets and trees from binary data
The discovery of subsets with special properties from binary data has been one of the key themes in pattern discovery. Pattern classes such as frequent itemsets stress the co-occu...
Eino Hinkkanen, Hannes Heikinheimo, Heikki Mannila...
130
Voted
KDD
2006
ACM
156views Data Mining» more  KDD 2006»
16 years 4 months ago
Unsupervised learning on k-partite graphs
Various data mining applications involve data objects of multiple types that are related to each other, which can be naturally formulated as a k-partite graph. However, the resear...
Bo Long, Xiaoyun Wu, Zhongfei (Mark) Zhang, Philip...
« Prev « First page 1075 / 1199 Last » Next »