Sciweavers

1016 search results - page 59 / 204
» Generalized distances between rankings
Sort
View
NETWORK
2007
167views more  NETWORK 2007»
15 years 8 days ago
Sensor Localization under Limited Measurement Capabilities
If we abstract a sensor network as a network graph consisting of vertices and edges, where vertices represent sensor nodes and edges represent distance measurements between neighbo...
Chen Wang, Li Xiao
SIAMCOMP
2000
125views more  SIAMCOMP 2000»
15 years 16 days ago
Approximating the Stretch Factor of Euclidean Graphs
There are several results available in the literature dealing with efficient construction of t-spanners for a given set S of n points in Rd. t-spanners are Euclidean graphs in whic...
Giri Narasimhan, Michiel H. M. Smid
89
Voted
NIPS
2007
15 years 2 months ago
Modeling homophily and stochastic equivalence in symmetric relational data
This article discusses a latent variable model for inference and prediction of symmetric relational data. The model, based on the idea of the eigenvalue decomposition, represents ...
Peter Hoff
118
Voted
SFP
2003
15 years 2 months ago
Testing Scheme programming assignments automatically
Abstract In distance learning the lack of direct communication between teachers and learners makes it difficult to provide direct assistance to students while they are solving the...
Manfred Widera
84
Voted
CORR
2010
Springer
134views Education» more  CORR 2010»
15 years 26 days ago
On the order bound for one-point AG codes
The order bound for the minimum distance of algebraic geometry codes is defined for the dual of one-point codes. A new bound for the minimum distance of linear codes, and for codes...
Olav Geil, Carlos Munuera, Diego Ruano, Fernando T...