Sciweavers

82 search results - page 11 / 17
» No four subsets forming an N
Sort
View
NIPS
2003
13 years 9 months ago
Minimax Embeddings
Spectral methods for nonlinear dimensionality reduction (NLDR) impose a neighborhood graph on point data and compute eigenfunctions of a quadratic form generated from the graph. W...
Matthew Brand
CSE
2009
IEEE
14 years 2 months ago
Inferring Unobservable Inter-community Links in Large Social Networks
Abstract—Social networks can be used to model social interactions between individuals. In many circumstances, not all interactions between individuals are observed. In such cases...
Heath Hohwald, Manuel Cebrián, Arturo Canal...
IPL
2002
125views more  IPL 2002»
13 years 7 months ago
A note concerning the closest point pair algorithm
An algorithm, described by Sedgewick, finds the distance between the closest pair of n given points in a plane using a variant of mergesort. This takes O(n log n) time. To prove t...
Martin Richards
ICC
2007
IEEE
144views Communications» more  ICC 2007»
14 years 1 months ago
Modelling Interference Temperature Constraints for Spectrum Access in Cognitive Radio Networks
— With the advent of cognitive radio technology, new paradigms for spectrum access can achieve near-optimal spectrum utilisation by letting each user sense and utilise available s...
Joe Bater, Hwee Pink Tan, Kenneth N. Brown, Linda ...
DM
2008
100views more  DM 2008»
13 years 7 months ago
Adaptive group testing for consecutive positives
Motivated from an application to DNA library screening, Balding and Torney [1] and Colbourn [4] studied the following group testing for consecutive positives. Suppose Vn = {v1 v2 ...
Justie Su-tzu Juan, Gerard J. Chang