Sciweavers

2489 search results - page 141 / 498
» On the Subgroup Distance Problem
Sort
View
170
Voted
EDBT
2012
ACM
255views Database» more  EDBT 2012»
13 years 6 months ago
Top-k spatial keyword queries on road networks
With the popularization of GPS-enabled devices there is an increasing interest for location-based queries. In this context, one interesting problem is processing top-k spatial key...
João B. Rocha-Junior, Kjetil Nørv&ar...
ACSC
2008
IEEE
15 years 10 months ago
Privacy preserving set intersection based on bilinear groups
We propose a more efficient privacy preserving set intersection protocol which improves the previously known result by a factor of O(N) in both the computation and communication c...
Yingpeng Sang, Hong Shen
IJAC
2002
128views more  IJAC 2002»
15 years 3 months ago
Computational Complexity of Generators and Nongenerators in Algebra
Abstract. We discuss the computational complexity of several problems concerning subsets of an algebraic structure that generate the structure. We show that the problem of determin...
Clifford Bergman, Giora Slutzki
FOCS
2004
IEEE
15 years 7 months ago
Triangulation and Embedding Using Small Sets of Beacons
Concurrent with recent theoretical interest in the problem of metric embedding, a growing body of research in the networking community has studied the distance matrix defined by n...
Jon M. Kleinberg, Aleksandrs Slivkins, Tom Wexler
BIBE
2005
IEEE
124views Bioinformatics» more  BIBE 2005»
15 years 9 months ago
Approximate Global Alignment of Sequences
We propose two novel dynamic programming (DP) methods that solve the the approximate bounded and unbounded global alignment problems for biological sequences. Our first method so...
Tamer Kahveci, Venkatakrishnan Ramaswamy, Han Tao,...