702 search results - page 10 / 141 » Identifying Graph Automorphisms Using Determining Sets |
112
click to vote
BMCBI
2008
14 years 11 months ago
2008
Background: The amount of gene expression data in the public repositories, such as NCBI Gene Expression Omnibus (GEO) has grown exponentially, and provides a gold mine for bioinfo...
179
click to vote
INFOCOM
2011
IEEE
14 years 3 months ago
2011
IEEE
—This paper addresses the problem of identifying the top-k information hubs in a social network. Identifying topk information hubs is crucial for many applications such as advert...
106
click to vote
DSN
2007
IEEE
15 years 3 months ago
2007
IEEE
We propose a new fault tolerance metric for XOR-based erasure codes: the minimal erasures list (MEL). A minimal erasure is a set of erasures that leads to irrecoverable data loss ...
3DPVT
2006
IEEE
15 years 5 months ago
2006
IEEE
A prerequisite to calibrated camera pose estimation is the construction of a camera neighborhood adjacency graph, a connected graph defining the pose neighbors of the camera set....
110
click to vote
IJCAI
1993
15 years 29 days ago
1993
Constraint relaxation is a frequently used technique for managing over-determined constraint satisfaction problems. A problem in constraint relaxation is the selection of the appr...