Sciweavers

2354 search results - page 468 / 471
» Randomness, Stochasticity and Approximations
Sort
View
KAIS
2011
129views more  KAIS 2011»
13 years 2 months ago
Counting triangles in real-world networks using projections
Triangle counting is an important problem in graph mining. Two frequently used metrics in complex network analysis which require the count of triangles are the clustering coefficie...
Charalampos E. Tsourakakis
SIAMCOMP
2011
13 years 2 months ago
The Chow Parameters Problem
Abstract. In the 2nd Annual FOCS (1961), Chao-Kong Chow proved that every Boolean threshold function is uniquely determined by its degree-0 and degree-1 Fourier coefficients. These...
Ryan O'Donnell, Rocco A. Servedio
TKDE
2011
332views more  TKDE 2011»
13 years 2 months ago
Adaptive Cluster Distance Bounding for High-Dimensional Indexing
—We consider approaches for similarity search in correlated, high-dimensional data-sets, which are derived within a clustering framework. We note that indexing by “vector appro...
Sharadh Ramaswamy, Kenneth Rose
WWW
2011
ACM
13 years 2 months ago
Network bucket testing
Bucket testing, also known as A/B testing, is a practice that is widely used by on-line sites with large audiences: in a simple version of the methodology, one evaluates a new fea...
Lars Backstrom, Jon M. Kleinberg
MVA
2010
206views Computer Vision» more  MVA 2010»
13 years 2 months ago
Estimating the motion of plant root cells from in vivo confocal laser scanning microscopy images
Images of cellular structures in growing plant roots acquired using confocal laser scanning microscopy (CLSM) have some unusual properties that make motion estimation challenging....
Timothy J. Roberts, Stephen J. McKenna, Cheng-Jin ...