Sciweavers

5210 search results - page 330 / 1042
» Exact geometric computation
Sort
View
KSEM
2007
Springer
16 years 26 days ago
Finding Similar RSS News Articles Using Correlation-Based Phrase Matching
Traditional phrase matching approaches, which can discover documents containing exactly the same phrases, fail to detect documents including phrases that are semantically relevant,...
Maria Soledad Pera, Yiu-Kai Ng
COMPGEOM
2004
ACM
16 years 5 days ago
An energy-driven approach to linkage unfolding
We present a new algorithm for unfolding planar polygonal linkages without self-intersection based on following the gradient flow of a “repulsive” energy function. This algor...
Jason H. Cantarella, Erik D. Demaine, Hayley N. Ib...
DASFAA
2010
IEEE
129views Database» more  DASFAA 2010»
15 years 11 months ago
Efficient Approximate Visibility Query in Large Dynamic Environments
Abstract. Visibility query is fundamental to many analysis and decisionmaking tasks in virtual environments. Visibility computation is time complex and the complexity escalates in ...
Leyla Kazemi, Farnoush Banaei Kashani, Cyrus Shaha...
176
Voted
ALGOSENSORS
2006
Springer
15 years 10 months ago
Self-deployment Algorithms for Mobile Sensors on a Ring
Abstract. We consider the self-deployment problem in a ring for a network of identical sensors: starting from some initial random placement in the ring, the sensors in the network ...
Paola Flocchini, Giuseppe Prencipe, Nicola Santoro
CPAIOR
2006
Springer
15 years 10 months ago
The Power of Semidefinite Programming Relaxations for MAX-SAT
Recently, Linear Programming (LP)-based relaxations have been shown promising in boosting the performance of exact MAX-SAT solvers. We compare Semidefinite Programming (SDP) based ...
Carla P. Gomes, Willem Jan van Hoeve, Lucian Leahu