Sciweavers

676 search results - page 66 / 136
» A Search-Free Intersection Algorithm
Sort
View
RTA
2010
Springer
13 years 11 months ago
Underspecified computation of normal forms
We consider the problem of computing, out of a set C of trees and a rewrite system R, those trees in C that cannot be rewritten into a tree in C. We solve this problem for sets of ...
Alexander Koller, Stefan Thater
COR
2010
123views more  COR 2010»
13 years 10 months ago
Multi-dimensional bin packing problems with guillotine constraints
The problem addressed in this paper is the decision problem of determining if a set of multi-dimensional rectangular boxes can be orthogonally packed into a rectangular bin while ...
Rasmus Resen Amossen, David Pisinger
MOR
2006
92views more  MOR 2006»
13 years 10 months ago
Polynomial-Time Separation of a Superclass of Simple Comb Inequalities
The comb inequalities are a well-known class of facet-inducing inequalities for the Traveling Salesman Problem, defined in terms of certain vertex sets called the handle and the t...
Lisa Fleischer, Adam N. Letchford, Andrea Lodi
TVCG
2008
92views more  TVCG 2008»
13 years 9 months ago
High-Quality Rendering of Quartic Spline Surfaces on the GPU
Abstract-- We present a novel GPU-based algorithm for highquality rendering of bivariate spline surfaces. An essential difference to the known methods for rendering graph surfaces ...
Gerd Reis, Frank Zeilfelder, Martin Hering-Bertram...
ICIP
2005
IEEE
14 years 11 months ago
A spatially adaptive Poissonian image deblurring
A spatially adaptive image deblurring algorithm is presented for Poisson observations. It adapts to the unknown image smoothness by using local polynomial approximation (LPA) kern...
Alessandro Foi, Sakari Alenius, Mejdi Trimeche, Vl...