1051 search results - page 31 / 211 » On the Correspondence between Approximations and Similarity |
189
click to vote
BCB
2010
15 years 1 months ago
2010
Analyzing metabolic pathways by means of their steady states has proven to be accurate and efficient for practical purposes. The models such as elementary flux modes (EFMs) and ex...
145
click to vote
INFOCOM
2009
IEEE
16 years 23 days ago
2009
IEEE
—We consider a wireless network of n nodes that communicate over a common wireless medium under some interference constraints. Our work is motivated by the need for an efficient...
148
click to vote
CVPR
2007
IEEE
16 years 8 months ago
2007
IEEE
Automatically determining facial similarity is a difficult and open question in computer vision. The problem is complicated both because it is unclear what facial features humans ...
146
click to vote
TMI
2008
15 years 6 months ago
2008
Computing the morphological similarity of diffusion tensors (DTs) at neighboring voxels within a DT image, or at corresponding locations across different DT images, is a fundamenta...
201
click to vote
COMBINATORICS
2002
15 years 6 months ago
2002
Erdos, Rubin, and Taylor found a nice correspondence between the minimum order of a complete bipartite graph that is not r-choosable and the minimum number of edges in an r-unifor...