Sciweavers

7129 search results - page 863 / 1426
» Approximation Algorithms for Treewidth
Sort
View
CIAC
2006
Springer
106views Algorithms» more  CIAC 2006»
15 years 10 months ago
On the Hardness of Range Assignment Problems
We investigate the computational hardness of the Connectivity, the Strong Connectivity and the Broadcast type of Range Assignment Problems in R2 and R3. We present new reductions ...
Bernhard Fuchs
EVOW
2006
Springer
15 years 9 months ago
Supervised Genetic Search for Parameter Selection in Painterly Rendering
This paper investigates the feasibility of evolutionary search techniques as a mechanism for interactively exploring the design space of 2D painterly renderings. Although a growing...
John P. Collomosse
KDD
2000
ACM
168views Data Mining» more  KDD 2000»
15 years 9 months ago
Scaling up dynamic time warping for datamining applications
There has been much recent interest in adapting data mining algorithms to time series databases. Most of these algorithms need to compare time series. Typically some variation of ...
Eamonn J. Keogh, Michael J. Pazzani
RT
2000
Springer
15 years 9 months ago
Interactive Rendering with Real-World Illumination
We propose solutions for seamlessly integrating synthetic objects into background photographs at interactive rates. Recently developed image-based methods are used to capture real...
Simon Gibson, Alan Murta
COSIT
1995
Springer
103views GIS» more  COSIT 1995»
15 years 9 months ago
On the Determination of the Optimum Path in Space
: Various algorithms have been proposed for the determination of the optimum paths in line networks. Moving in space is a far more complex problem, where research has been scarce. ...
Emmanuel Stefanakis, Marinos Kavouras