Sciweavers

1511 search results - page 116 / 303
» Randomness, lowness and degrees
Sort
View
SC
2000
ACM
15 years 10 months ago
Data Access Performance in a Large and Dynamic Pharmaceutical Drug Candidate Database
An explosion in the amount of data generated through chemical and biological experimentation has been observed in recent years. This rapid proliferation of vast amounts of data ha...
Zina Ben-Miled, Yang Liu, David Powers, Omran A. B...
DM
2011
264views Education» more  DM 2011»
15 years 1 months ago
Connectivity threshold and recovery time in rank-based models for complex networks
The World Wide Web may be viewed as a graph each of whose vertices corresponds to a static HTML web page, and each of whose edges corresponds to a hyperlink from one web page to an...
Pawel Pralat
ICS
2010
Tsinghua U.
16 years 3 months ago
Local Algorithms for Finding Interesting Individuals in Large Networks
: We initiate the study of local, sublinear time algorithms for finding vertices with extreme topological properties -- such as high degree or clustering coefficient -- in large so...
Mickey Brautbar, Michael Kearns
CIKM
2009
Springer
16 years 27 days ago
Privacy-enhanced public view for social graphs
We consider the problem of releasing a limited public view of a sensitive graph which reveals at least k edges per node. We are motivated by Facebook’s public search listings, w...
Hyoungshick Kim, Joseph Bonneau
ICRA
2006
IEEE
183views Robotics» more  ICRA 2006»
16 years 11 days ago
Anytime Dynamic Path-planning with Flexible Probabilistic Roadmaps
Abstract— Probabilistic roadmaps (PRM) have been demonstrated to be very promising for planning paths for robots with high degrees of freedom in complex 3D workspaces. In this pa...
Khaled Belghith, Froduald Kabanza, Leo Hartman, Ro...