Sciweavers

3819 search results - page 450 / 764
» Simple Easy Terms
Sort
View
MOBIHOC
2009
ACM
16 years 7 months ago
Improved bounds on the throughput efficiency of greedy maximal scheduling in wireless networks
Due to its low complexity, Greedy Maximal Scheduling (GMS), also known as Longest Queue First (LQF), has been studied extensively for wireless networks. However, GMS can result in...
Mathieu Leconte, Jian Ni, Rayadurgam Srikant
KDD
2006
ACM
143views Data Mining» more  KDD 2006»
16 years 7 months ago
Algorithms for discovering bucket orders from data
Ordering and ranking items of different types are important tasks in various applications, such as query processing and scientific data mining. A total order for the items can be ...
Aristides Gionis, Heikki Mannila, Kai Puolamä...
KDD
2006
ACM
146views Data Mining» more  KDD 2006»
16 years 7 months ago
Structure and evolution of online social networks
In this paper, we consider the evolution of structure within large online social networks. We present a series of measurements of two such networks, together comprising in excess ...
Ravi Kumar, Jasmine Novak, Andrew Tomkins
KDD
2005
ACM
168views Data Mining» more  KDD 2005»
16 years 7 months ago
Nomograms for visualizing support vector machines
We propose a simple yet potentially very effective way of visualizing trained support vector machines. Nomograms are an established model visualization technique that can graphica...
Aleks Jakulin, Martin Mozina, Janez Demsar, Ivan B...
KDD
2005
ACM
160views Data Mining» more  KDD 2005»
16 years 7 months ago
Optimizing time series discretization for knowledge discovery
Knowledge Discovery in time series usually requires symbolic time series. Many discretization methods that convert numeric time series to symbolic time series ignore the temporal ...
Alfred Ultsch, Fabian Mörchen