2681 search results - page 149 / 537 » Problem F |
110
click to vote
ICPPW
2003
IEEE
15 years 6 months ago
2003
IEEE
Gaussian Cubes (GCs) are a family of interconnection topologies in which the interconnection density and algorithmic efficiency are linked by a common parameter, the variation of ...
108
click to vote
FOCS
2002
IEEE
15 years 5 months ago
2002
IEEE
We obtain a near-tight bound of O(n3+ε ), for any ε > 0, on the complexity of the overlay of the minimization diagrams of two collections of surfaces in four dimensions. This...
127
click to vote
MFCS
2009
Springer
15 years 5 months ago
2009
Springer
We present a simple algorithm for the maximum spanning star forest problem. We take advantage of the fact that the problem is a special case of complementary set cover and we adapt...
87
Voted
FLAIRS
2004
15 years 2 months ago
2004
We propose a rigorous definition of the notion of typicality, making use of the strict partial order naturally induced among the objects at hand by a given concept. This perspecti...
79
Voted
SODA
1998
ACM
15 years 2 months ago
1998
ACM
We consider the problem of implementing nger search trees on the pointer machine, i.e., how to maintain a sorted list such that searching for an element x, starting the search at ...