3136 search results - page 103 / 628 » Comparison of Clique-Listing Algorithms |
160
click to vote
PICS
1998
15 years 7 months ago
1998
This paper describes a more efficient paired comparison method that reduces the number of trials necessary for converting a table of paired comparisons into scalar data. Instead o...
197
click to vote
PRDC
2006
IEEE
16 years 9 days ago
2006
IEEE
This paper presents the performance analysis of several well-known partitioning scheduling algorithms in real-time and fault-tolerant multiprocessor systems. Both static and dynam...
265
click to vote
VLDB
2001
ACM
16 years 6 months ago
2001
ACM
The problem of answering queries using views is to find efficient methods of answering a query using a set of previously materialized views over the database, rather than accessing...
173
click to vote
JDCTA
2010
15 years 1 months ago
2010
To quickly get the median value of any given sequence is very important in many research fields. Some popular sort algorithms are discussed in this paper. Selection sort algorithm...
165
click to vote
ISSAC
2005
Springer
15 years 11 months ago
2005
Springer
Let A and B be two polynomials in [x,y] and let R = resx(A, B) denote the resultant of A and B taken wrt x. In this paper we modify Collins’ modular algorithm for computing R...