Sciweavers

794 search results - page 106 / 159
» Improved algorithms for orienteering and related problems
Sort
View
SIGGRAPH
1999
ACM
14 years 1 days ago
Implicit Fairing of Irregular Meshes Using Diffusion and Curvature Flow
In this paper, we develop methods to rapidly remove rough features from irregularly triangulated data intended to portray a smooth surface. The main task is to remove undesirable ...
Mathieu Desbrun, Mark Meyer, Peter Schröder, ...
ATAL
2009
Springer
14 years 2 months ago
Directed soft arc consistency in pseudo trees
We propose an efficient method that applies directed soft arc consistency to a Distributed Constraint Optimization Problem (DCOP) which is a fundamental framework of multi-agent ...
Toshihiro Matsui, Marius-Calin Silaghi, Katsutoshi...
ICDE
2002
IEEE
138views Database» more  ICDE 2002»
14 years 9 months ago
Efficient Temporal Join Processing Using Indices
We examine the problem of processing temporal joins in the presence of indexing schemes. Previous work on temporal joins has concentrated on non-indexed relations which were fully...
Donghui Zhang, Vassilis J. Tsotras, Bernhard Seege...
WWW
2011
ACM
13 years 2 months ago
Rewriting queries on SPARQL views
The problem of answering SPARQL queries over virtual SPARQL views is commonly encountered in a number of settings, including while enforcing security policies to access RDF data, ...
Wangchao Le, Songyun Duan, Anastasios Kementsietsi...
CORR
2007
Springer
144views Education» more  CORR 2007»
13 years 7 months ago
Optimization of Information Rate Upper and Lower Bounds for Channels with Memory
—We consider the problem of minimizing upper bounds and maximizing lower bounds on information rates of stationary and ergodic discrete-time channels with memory. The channels we...
Parastoo Sadeghi, Pascal O. Vontobel, Ramtin Shams