Sciweavers

702 search results - page 10 / 141
» Identifying Graph Automorphisms Using Determining Sets
Sort
View
BMCBI
2008
126views more  BMCBI 2008»
13 years 8 months ago
GeneChaser: Identifying all biological and clinical conditions in which genes of interest are differentially expressed
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...
Rong Chen, Rohan Mallelwar, Ajit Thosar, Shivkumar...
INFOCOM
2011
IEEE
13 years 5 days ago
A distributed and privacy preserving algorithm for identifying information hubs in social networks
—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...
Muhammad Usman Ilyas, Muhammad Zubair Shafiq, Alex...
DSN
2007
IEEE
14 years 11 days ago
Determining Fault Tolerance of XOR-Based Erasure Codes Efficiently
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 ...
Jay J. Wylie, Ram Swaminathan
3DPVT
2006
IEEE
194views Visualization» more  3DPVT 2006»
14 years 2 months ago
Histogram Matching for Camera Pose Neighbor Selection
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....
Kevin L. Steele, Parris K. Egbert, Bryan S. Morse
IJCAI
1993
13 years 9 months ago
Diagnosing and Solving Over-Determined Constraint Satisfaction Problems
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...
R. R. Bakker, F. Dikker, F. Tempelman, P. M. Wognu...