Sciweavers

4860 search results - page 919 / 972
» SNPs Problems, Complexity, and Algorithms
Sort
View
ICDM
2010
IEEE
232views Data Mining» more  ICDM 2010»
13 years 6 months ago
gSkeletonClu: Density-Based Network Clustering via Structure-Connected Tree Division or Agglomeration
Community detection is an important task for mining the structure and function of complex networks. Many pervious approaches are difficult to detect communities with arbitrary size...
Heli Sun, Jianbin Huang, Jiawei Han, Hongbo Deng, ...
ICCV
2011
IEEE
12 years 8 months ago
The Power of Comparative Reasoning
Rank correlation measures are known for their resilience to perturbations in numeric values and are widely used in many evaluation metrics. Such ordinal measures have rarely been ...
Jay Yagnik, Dennis Strelow, David Ross, Ruei-sung ...
FSTTCS
2009
Springer
14 years 3 months ago
Fractional Pebbling and Thrifty Branching Programs
We study the branching program complexity of the tree evaluation problem, introduced in [BCM+09a] as a candidate for separating NL from LogCFL. The input to the problem is a roote...
Mark Braverman, Stephen A. Cook, Pierre McKenzie, ...
SPAA
2009
ACM
14 years 9 months ago
Dynamic external hashing: the limit of buffering
Hash tables are one of the most fundamental data structures in computer science, in both theory and practice. They are especially useful in external memory, where their query perf...
Zhewei Wei, Ke Yi, Qin Zhang
CVPR
2009
IEEE
15 years 1 months ago
Tracking of a Non-Rigid Object via Patch-based Dynamic Appearance Modeling and Adaptive Basin Hopping Monte Carlo Sampling
We propose a novel tracking algorithm for the target of which geometric appearance changes drastically over time. To track it, we present a local patch-based appearance model and p...
Junseok Kwon (Seoul National University), Kyoung M...