Sciweavers

5115 search results - page 239 / 1023
» On Randomized Lanczos Algorithms
Sort
View
KDD
2009
ACM
239views Data Mining» more  KDD 2009»
16 years 7 months ago
Tell me something I don't know: randomization strategies for iterative data mining
There is a wide variety of data mining methods available, and it is generally useful in exploratory data analysis to use many different methods for the same dataset. This, however...
Heikki Mannila, Kai Puolamäki, Markus Ojala, ...
IPPS
2008
IEEE
16 years 1 months ago
Random choices for churn resilient load balancing in peer-to-peer networks
Peer-to-peer (P2P) networks based on consistent hashing functions have an inherent load uneven distribution problem. Things are even worse in unstructured P2P systems. The objecti...
Song Fu, Cheng-Zhong Xu, Haiying Shen
PLDI
2005
ACM
16 years 18 days ago
DART: directed automated random testing
We present a new tool, named DART, for automatically testing software that combines three main techniques: (1) automated extraction of the interface of a program with its external...
Patrice Godefroid, Nils Klarlund, Koushik Sen
KDD
2010
ACM
252views Data Mining» more  KDD 2010»
15 years 11 months ago
Fast query execution for retrieval models based on path-constrained random walks
Many recommendation and retrieval tasks can be represented as proximity queries on a labeled directed graph, with typed nodes representing documents, terms, and metadata, and labe...
Ni Lao, William W. Cohen
COMCOM
2006
147views more  COMCOM 2006»
15 years 7 months ago
Coverage-adaptive random sensor scheduling for application-aware data gathering in wireless sensor networks
Due to the application-specific nature of wireless sensor networks, application-aware algorithm and protocol design paradigms are highly required in order to optimize the overall ...
Wook Choi, Sajal K. Das