Sciweavers

1193 search results - page 239 / 239
» On the Complexity of Approximating Colored-Graph Problems
Sort
View
SIGPRO
2002
160views more  SIGPRO 2002»
13 years 4 months ago
New multiscale transforms, minimum total variation synthesis: applications to edge-preserving image reconstruction
This paper describes newly invented multiscale transforms known under the name of the ridgelet [6] and the curvelet transforms [9, 8]. These systems combine ideas of multiscale an...
Emmanuel J. Candès, Franck Guo
KAIS
2011
129views more  KAIS 2011»
13 years 6 days 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
WWW
2011
ACM
13 years 5 days 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