Sciweavers

1346 search results - page 2 / 270
» Algorithmic Search for Flexibility Using Resultants of Polyn...
Sort
View
JACM
2000
119views more  JACM 2000»
13 years 5 months ago
A subdivision-based algorithm for the sparse resultant
Multivariate resultants generalize the Sylvester resultant of two polynomials and characterize the solvability of a polynomial system. They also reduce the computation of all comm...
John F. Canny, Ioannis Z. Emiris
ICPR
2008
IEEE
13 years 12 months ago
Re-ranking of web image search results using a graph algorithm
We propose a method to improve the results of image search engines on the Internet to satisfy users who desire to see relevant images in the first few pages. The method re-ranks ...
Hilal Zitouni, Sare Gul Sevil, Derya Ozkan, Pinar ...
CADE
1992
Springer
13 years 9 months ago
Polynomial Interpretations and the Complexity of Algorithms
The ability to use a polynomial iterpretation to prove termination of a rewrite system naturally prompts the question as to what restriction on complexity this imposes. The main r...
Adam Cichon, Pierre Lescanne
FOCS
1999
IEEE
13 years 9 months ago
A Study of Proof Search Algorithms for Resolution and Polynomial Calculus
This paper is concerned with the complexity of proofs and of searching for proofs in two propositional proof systems: Resolution and Polynomial Calculus (PC). For the former syste...
Maria Luisa Bonet, Nicola Galesi
DKE
2007
162views more  DKE 2007»
13 years 5 months ago
A new algorithm for clustering search results
We develop a new algorithm for clustering search results. Differently from many other clustering systems that have been recently proposed as a post-processing step for Web search ...
Giansalvatore Mecca, Salvatore Raunich, Alessandro...