19320 search results - page 34 / 3864 » On the complexity of computing determinants |
SIGECOM
2005
ACM
15 years 3 months ago
2005
ACM
We study various computational aspects of solving games using dominance and iterated dominance. We first study both strict and weak dominance (not iterated), and show that checki...
106
click to vote
SIGMOD
2004
ACM
15 years 9 months ago
2004
ACM
The detection of correlations between different features in a set of feature vectors is a very important data mining task because correlation indicates a dependency between the fe...
80
Voted
COSIT
1995
Springer
15 years 1 months ago
1995
Springer
: Various algorithms have been proposed for the determination of the optimum paths in line networks. Moving in space is a far more complex problem, where research has been scarce. ...
79
Voted
CORR
2006
Springer
14 years 9 months ago
2006
Springer
Let S = s1, s2, s3, ..., sn be a given vector of n distinct real numbers. The rank of z R with respect to S is defined as the number of elements si S such that si z. We consider...
102
click to vote
SIGGRAPH
1993
ACM
15 years 1 months ago
1993
ACM
The most expensive geometric operation in image synthesis is visibility determination. Classically this is solved with hidden surface removal algorithms that render only the parts...