Sciweavers

6045 search results - page 903 / 1209
» Computable Linearizations of Well-partial-orderings
Sort
View
172
Voted
IMR
2004
Springer
16 years 3 days ago
Efficient Spacetime Meshing with Nonlocal Cone Constraints
Spacetime Discontinuous Galerkin (DG) methods are used to solve hyperbolic PDEs describing wavelike physical phenomena. When the PDEs are nonlinear, the speed of propagation of th...
Shripad Thite
ICDE
2010
IEEE
434views Database» more  ICDE 2010»
16 years 1 days ago
Route skyline queries: A multi-preference path planning approach
— In recent years, the research community introduced various methods for processing skyline queries in multidimensional databases. The skyline operator retrieves all objects bein...
Hans-Peter Kriegel, Matthias Renz, Matthias Schube...
SI3D
2010
ACM
16 years 1 days ago
LEAN mapping
We introduce Linear Efficient Antialiased Normal (LEAN) Mapping, a method for real-time filtering of specular highlights in bump and normal maps. The method evaluates bumps as p...
Marc Olano, Dan Baker
FCT
2003
Springer
15 years 12 months ago
Graph Searching, Elimination Trees, and a Generalization of Bandwidth
The bandwidth minimization problem has a long history and a number of practical applications. In this paper we introduce a natural extension of bandwidth to partially ordered layo...
Fedor V. Fomin, Pinar Heggernes, Jan Arne Telle
CCO
2001
Springer
143views Combinatorics» more  CCO 2001»
15 years 11 months ago
TSP Cuts Which Do Not Conform to the Template Paradigm
Abstract. The first computer implementation of the Dantzig-FulkersonJohnson cutting-plane method for solving the traveling salesman problem, written by Martin, used subtour inequa...
David Applegate, Robert E. Bixby, Vasek Chvá...