Sciweavers

308 search results - page 52 / 62
» A new enhanced constructive decomposition and mapping algori...
Sort
View
ICDE
2012
IEEE
343views Database» more  ICDE 2012»
12 years 12 months ago
Bi-level Locality Sensitive Hashing for k-Nearest Neighbor Computation
We present a new Bi-level LSH algorithm to perform approximate k-nearest neighbor search in high dimensional spaces. Our formulation is based on a two-level scheme. In the first ...
Jia Pan, Dinesh Manocha
CORR
2007
Springer
140views Education» more  CORR 2007»
14 years 9 months ago
From the entropy to the statistical structure of spike trains
— We use statistical estimates of the entropy rate of spike train data in order to make inferences about the underlying structure of the spike train itself. We first examine a n...
Yun Gao, Ioannis Kontoyiannis, Elie Bienenstock
COCO
2009
Springer
105views Algorithms» more  COCO 2009»
15 years 4 months ago
Planar Graph Isomorphism is in Log-Space
Graph Isomorphism is the prime example of a computational problem with a wide difference between the best known lower and upper bounds on its complexity. There is a significant ...
Samir Datta, Nutan Limaye, Prajakta Nimbhorkar, Th...
DOLAP
2006
ACM
15 years 3 months ago
Towards a logical multidimensional model for spatial data warehousing and OLAP
Decision support systems (DSS) may be enhanced qualitatively if they are able to also deal with spatial dimensions and measures. Regardless the evident importance of using data wa...
Marcus Costa Sampaio, Andre Gomes de Sousa, Cl&aac...
COMSWARE
2007
IEEE
15 years 3 months ago
Smaller Connected Dominating Sets in Ad Hoc and Sensor Networks based on Coverage by Two-Hop Neighbors
— In this paper, we focus on the construction of an efficient dominating set in ad hoc and sensor networks. A set of nodes is said to be dominating if each node is either itself...
François Ingelrest, David Simplot-Ryl, Ivan...