Sciweavers

7228 search results - page 164 / 1446
» From Algorithmic to Subjective Randomness
Sort
View
ACMSE
2005
ACM
15 years 9 months ago
Bibliometric approach to community discovery
Recent research suggests that most of the real-world random networks organize themselves into communities. Communities are formed by subsets of nodes in a graph, which are closely...
Narsingh Deo, Hemant Balakrishnan
GECCO
2011
Springer
248views Optimization» more  GECCO 2011»
14 years 7 months ago
Size-based tournaments for node selection
In genetic programming, the reproductive operators of crossover and mutation both require the selection of nodes from the reproducing individuals. Both unbiased random selection a...
Thomas Helmuth, Lee Spector, Brian Martin
SIGMOD
1998
ACM
99views Database» more  SIGMOD 1998»
15 years 8 months ago
CURE: An Efficient Clustering Algorithm for Large Databases
Clustering, in data mining, is useful for discovering groups and identifying interesting distributions in the underlying data. Traditional clustering algorithms either favor clust...
Sudipto Guha, Rajeev Rastogi, Kyuseok Shim
257
Voted
SIGMOD
2009
ACM
250views Database» more  SIGMOD 2009»
16 years 4 months ago
Query processing techniques for solid state drives
Solid state drives perform random reads more than 100x faster than traditional magnetic hard disks, while offering comparable sequential read and write bandwidth. Because of their...
Dimitris Tsirogiannis, Stavros Harizopoulos, Mehul...
133
Voted
PAMI
2006
171views more  PAMI 2006»
15 years 3 months ago
Camera Calibration from Video of a Walking Human
A self-calibration method to estimate a camera's intrinsic and extrinsic parameters from vertical line segments of the same height is presented. An algorithm to obtain the nee...
Fengjun Lv, Tao Zhao, Ramakant Nevatia