Sciweavers

330 search results - page 47 / 66
» Random Indexing Revisited
Sort
View
92
Voted
DKE
2006
67views more  DKE 2006»
15 years 11 days ago
Indexed-based density biased sampling for clustering applications
Density biased sampling (DBS) has been proposed to address the limitations of Uniform sampling, by producing the desired probability distribution in the sample. The ease of produc...
Alexandros Nanopoulos, Yannis Theodoridis, Yannis ...
COMBINATORICS
2007
77views more  COMBINATORICS 2007»
15 years 10 days ago
Enumeration and Asymptotic Properties of Unlabeled Outerplanar Graphs
We determine the exact and asymptotic number of unlabeled outerplanar graphs. The exact number gn of unlabeled outerplanar graphs on n vertices can be computed in polynomial time,...
Manuel Bodirsky, Éric Fusy, Mihyun Kang, St...
127
Voted
CRYPTO
2012
Springer
262views Cryptology» more  CRYPTO 2012»
13 years 2 months ago
Functional Encryption with Bounded Collusions via Multi-party Computation
We construct a functional encryption scheme secure against an a-priori bounded polynomial number of collusions for the class of all polynomial-size circuits. Our constructions req...
Sergey Gorbunov, Vinod Vaikuntanathan, Hoeteck Wee
92
Voted
ICML
2009
IEEE
16 years 1 months ago
Information theoretic measures for clusterings comparison: is a correction for chance necessary?
Information theoretic based measures form a fundamental class of similarity measures for comparing clusterings, beside the class of pair-counting based and set-matching based meas...
Xuan Vinh Nguyen, Julien Epps, James Bailey
94
Voted
MOBIQUITOUS
2007
IEEE
15 years 6 months ago
Assessing Standard and Inverted Skip Graphs Using Multi-Dimensional Range Queries and Mobile Nodes
—The skip graph, an application-layer data structure for routing and indexing, may be used in a sensor network to facilitate queries of the distributed k-dimensional data collect...
Gregory J. Brault, Christopher J. Augeri, Barry E....