2969 search results - page 120 / 594 » A space efficient algorithm for group structure computation |
215
click to vote
VLDB
2004
ACM
16 years 3 months ago
2004
ACM
In this paper, we propose a new tunable index scheme, called iMinMax(), that maps points in highdimensional spaces to single-dimensional values determined by their maximum or minim...
ESA
2010
Springer
15 years 4 months ago
2010
Springer
abstract appeared in Proc. 24th Annual Symposium of Computational Geometry (SoCG), 2008, pp. 338-345. S. Shannigrahi and S. P. Pal, "Efficient Prufer-like Coding and Counting ...
130
Voted
AI
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. A conditioning graph (CG) is a graphical structure that attempt to minimize the implementation overhead of computing probabilities in belief networks. A conditioning grap...
112
Voted
ICPR
2004
IEEE
16 years 4 months ago
2004
IEEE
y trees are well-known abstract structures. This paper proposes a new shape-based image retrieval method based on concavity trees. The proposed method has two main components. The...
127
click to vote
CSC
2008
15 years 4 months ago
2008
- The set-covering problem is an interesting problem in computational complexity theory. In [1], the setcovering problem has been proved to be NP hard and a greedy heuristic algori...