Sciweavers

5595 search results - page 433 / 1119
» Approximation Algorithms for Clustering Problems
Sort
View
SIBGRAPI
2005
IEEE
16 years 1 months ago
A Linear Algorithm for Exact Pattern Matching in Planar Subdivisions
Graph sub-isomorphism is a very common approach to solving pattern search problems, but this is a NP-complete problem. This way, it is necessary to invest in research of approxima...
Pedro Ribeiro de Andrade Neto, André Luiz P...
158
Voted
GECCO
2005
Springer
117views Optimization» more  GECCO 2005»
16 years 1 months ago
Evolutionary algorithms for medical simulations: a case study in minimally-invasive vascular interventions
To obtain the expertise to correctly perform minimally– invasive vascular interventions thorough training is required. Training using simulation systems are increasingly becomin...
Peter A. N. Bosman, Tanja Alderliesten
ICALP
2004
Springer
16 years 26 days ago
Algorithms for Multi-product Pricing
In the information age, the availability of data on consumer profiles has opened new possibilities for companies to increase their revenue via data mining techniques. One approach...
Gagan Aggarwal, Tomás Feder, Rajeev Motwani...
189
Voted
CGVR
2006
15 years 8 months ago
Real-time Computation of Area Shadows - A Geometrical Algorithm
The computation of soft shadows created by area light sources is a well-known problem in computer graphics. Due to the complexity of the problem, soft shadows commonly are generat...
Michael Boehl, Wolfgang Stürzlinger
199
Voted
INFOCOM
2002
IEEE
16 years 12 days ago
Restoration Algorithms for Virtual Private Networks in the Hose Model
—A Virtual Private Network (VPN) aims to emulate the services provided by a private network over the shared Internet. The endpoints of e connected using abstractions such as Virt...
Giuseppe F. Italiano, Rajeev Rastogi, Bülent ...