Sciweavers

5966 search results - page 1179 / 1194
» Distributed Caching Algorithms for Content Distribution Netw...
Sort
View
ICDE
2009
IEEE
177views Database» more  ICDE 2009»
14 years 9 months ago
Light-Weight, Runtime Verification of Query Sources
Modern database systems increasingly make use of networked storage. This storage can be in the form of SAN's or in the form of shared-nothing nodes in a cluster. One type of a...
Tingjian Ge, Stanley B. Zdonik
PODC
2009
ACM
14 years 8 months ago
Oblivious interference scheduling
In the interference scheduling problem, one is given a set of n communication requests described by pairs of points from a metric space. The points correspond to devices in a wire...
Alexander Fanghänel, Berthold Vöcking, H...
KDD
2009
ACM
203views Data Mining» more  KDD 2009»
14 years 8 months ago
Characterizing individual communication patterns
The increasing availability of electronic communication data, such as that arising from e-mail exchange, presents social and information scientists with new possibilities for char...
R. Dean Malmgren, Jake M. Hofman, Luis A. N. Amara...
KDD
2008
ACM
165views Data Mining» more  KDD 2008»
14 years 8 months ago
Colibri: fast mining of large static and dynamic graphs
Low-rank approximations of the adjacency matrix of a graph are essential in finding patterns (such as communities) and detecting anomalies. Additionally, it is desirable to track ...
Hanghang Tong, Spiros Papadimitriou, Jimeng Sun, P...
KDD
2001
ACM
192views Data Mining» more  KDD 2001»
14 years 8 months ago
Data mining with sparse grids using simplicial basis functions
Recently we presented a new approach [18] to the classification problem arising in data mining. It is based on the regularization network approach but, in contrast to other method...
Jochen Garcke, Michael Griebel
« Prev « First page 1179 / 1194 Last » Next »