Sciweavers

1845 search results - page 275 / 369
» Machine-Learning Applications of Algorithmic Randomness
Sort
View
SODA
2010
ACM
209views Algorithms» more  SODA 2010»
14 years 5 months ago
Counting Stars and Other Small Subgraphs in Sublinear Time
Detecting and counting the number of copies of certain subgraphs (also known as network motifs or graphlets), is motivated by applications in a variety of areas ranging from Biolo...
Mira Gonen, Dana Ron, Yuval Shavitt
WWW
2009
ACM
14 years 8 months ago
Tag ranking
Social media sharing web sites like Flickr allow users to annotate images with free tags, which significantly facilitate Web image search and organization. However, the tags assoc...
Dong Liu, Xian-Sheng Hua, Linjun Yang, Meng Wang, ...
CIKM
2009
Springer
14 years 2 months ago
Fast shortest path distance estimation in large networks
In this paper we study approximate landmark-based methods for point-to-point distance estimation in very large networks. These methods involve selecting a subset of nodes as landm...
Michalis Potamias, Francesco Bonchi, Carlos Castil...
KDD
2004
ACM
173views Data Mining» more  KDD 2004»
14 years 8 months ago
A microeconomic data mining problem: customer-oriented catalog segmentation
The microeconomic framework for data mining [7] assumes that an enterprise chooses a decision maximizing the overall utility over all customers where the contribution of a custome...
Martin Ester, Rong Ge, Wen Jin, Zengjian Hu
APPROX
2009
Springer
85views Algorithms» more  APPROX 2009»
14 years 2 months ago
Pseudorandom Generators and Typically-Correct Derandomization
The area of derandomization attempts to provide efficient deterministic simulations of randomized algorithms in various algorithmic settings. Goldreich and Wigderson introduced a n...
Jeff Kinne, Dieter van Melkebeek, Ronen Shaltiel