Sciweavers

699 search results - page 64 / 140
» The method of combinatorial telescoping
Sort
View
95
Voted
SDM
2009
SIAM
219views Data Mining» more  SDM 2009»
15 years 9 months ago
A Hybrid Data Mining Metaheuristic for the p-Median Problem.
Metaheuristics represent an important class of techniques to solve, approximately, hard combinatorial optimization problems for which the use of exact methods is impractical. In t...
Alexandre Plastino, Erick R. Fonseca, Richard Fuch...
115
Voted
IJCAI
2003
15 years 1 months ago
Automated Reasoning: Past Story and New Trends
We overview the development of first-order automated reasoning systems starting from their early years. Based on the analysis of current and potential applications of such systems...
Andrei Voronkov
120
Voted
COMGEO
2007
ACM
15 years 17 days ago
On incremental rendering of silhouette maps of a polyhedral scene
We consider the problem of incrementally rendering a polyhedral scene while the viewpoint is moving. In practical situations the number of geometric primitives to be rendered can ...
Alon Efrat, Leonidas J. Guibas, Olaf A. Hall-Holt,...
JCB
2008
90views more  JCB 2008»
15 years 17 days ago
A Simple Model of the Modular Structure of Transcriptional Regulation in Yeast
Resolving the general organizational principles that govern the interactions during transcriptional gene regulation has great relevance for understanding disease progression, biof...
Vladimir Filkov, Nameeta Shah
CVPR
2005
IEEE
16 years 2 months ago
Optimal Point Correspondence through the Use of Rank Constraints
We propose a solution to the n-frame correspondence problem under the factorization framework. During the matching process, our algorithm takes explicitly into account the geometr...
João Costeira, João Xavier, Ricardo ...