1728 search results - page 170 / 346 » Surface distance maps |
137
click to vote
JCT
2006
15 years 6 months ago
2006
Let Ng(f ) denote the number of rooted maps of genus g having f edges. An exact formula for Ng(f ) is known for g = 0 (Tutte, 1963), g = 1 (Arques, 1987), g = 2,3 (Bender and Canf...
168
Voted
CORR
2007
Springer
15 years 6 months ago
2007
Springer
A barycentric mapping of a planar graph is a plane embedding in which every internal vertex is the average of its neighbours. A celebrated result of Tutte’s [16] is that if a pl...
188
click to vote
INFOCOM
2008
IEEE
16 years 1 months ago
2008
IEEE
Abstract—In road networks, sensors are deployed sparsely (hundreds of meters apart) to save costs. This makes the existing localization solutions based on the ranging be ineffect...
192
click to vote
GRC
2010
IEEE
15 years 7 months ago
2010
IEEE
Inference of latent variables from complicated data is one important problem in data mining. The high dimensionality and high complexity of real world data often make accurate infe...
173
click to vote
BMCBI
2004
15 years 6 months ago
2004
Background: Short oligonucleotide arrays have several probes measuring the expression level of each target transcript. Therefore the selection of probes is a key component for the...