Sciweavers

4926 search results - page 28 / 986
» Two Graph Algorithms On an Associative Computing Model
Sort
View
KDD
2008
ACM
181views Data Mining» more  KDD 2008»
14 years 8 months ago
Fastanova: an efficient algorithm for genome-wide association study
Studying the association between quantitative phenotype (such as height or weight) and single nucleotide polymorphisms (SNPs) is an important problem in biology. To understand und...
Xiang Zhang, Fei Zou, Wei Wang 0010
NETWORKS
2010
13 years 6 months ago
Probabilistic models for the Steiner Tree problem
We consider a probabilistic model for the Steiner Tree problem. Under this model the problem is defined in a 2-stage setting over a first-stage complete weighted graph having it...
Vangelis Th. Paschos, Orestis Telelis, Vassilis Zi...
CVPR
2011
IEEE
12 years 11 months ago
An Associate-Predict Model for Face Recognition
Handling intra-personal variation is a major challenge in face recognition. It is difficult how to appropriately measure the similarity between human faces under significantly di...
Qi Yin, Jian Sun, Xiaoou Tang
SODA
1994
ACM
138views Algorithms» more  SODA 1994»
13 years 9 months ago
Average Case Analysis of Dynamic Geometric Optimization
We maintain the maximum spanning tree of a planar point set, as points are inserted or deleted, in O(log3 n) time per update in Mulmuley's expected-case model of dynamic geom...
David Eppstein
ICPR
2002
IEEE
14 years 8 months ago
A New Algorithm for Inexact Graph Matching
The graph is an essential data structure for representing relational information. When graphs are used to represent objects, comparing objects amounts to graph matching. Inexact g...
Adel Hlaoui, Shengrui Wang