Sciweavers

267 search results - page 44 / 54
» Inspections - Some Surprising Findings
Sort
View
ICCV
2007
IEEE
16 years 1 months ago
Detecting Illumination in Images
In this paper we present a surprisingly simple yet powerful method for detecting illumination--determining which pixels are lit by different lights--in images. Our method is based...
Clément Fredembach, Graham D. Finlayson, Ma...
107
Voted
CCS
2009
ACM
16 years 9 days ago
The union-split algorithm and cluster-based anonymization of social networks
Knowledge discovery on social network data can uncover latent social trends and produce valuable findings that benefit the welfare of the general public. A growing amount of resea...
Brian Thompson, Danfeng Yao
95
Voted
STOC
2005
ACM
135views Algorithms» more  STOC 2005»
16 years 19 hour ago
On the bias of traceroute sampling: or, power-law degree distributions in regular graphs
Understanding the graph structure of the Internet is a crucial step for building accurate network models and designing efficient algorithms for Internet applications. Yet, obtaini...
Dimitris Achlioptas, Aaron Clauset, David Kempe, C...
ICALP
2009
Springer
16 years 2 hour ago
Tight Bounds for the Cover Time of Multiple Random Walks
We study the cover time of multiple random walks. Given a graph G of n vertices, assume that k independent random walks start from the same vertex. The parameter of interest is the...
Robert Elsässer, Thomas Sauerwald
CHI
2010
ACM
15 years 6 months ago
Social network activity and social well-being
Previous research has shown a relationship between use of social networking sites and feelings of social capital. However, most studies have relied on self-reports by college stud...
Moira Burke, Cameron Marlow, Thomas M. Lento