Sciweavers

3096 search results - page 226 / 620
» The Generalized FITC Approximation
Sort
View
CIKM
2009
Springer
16 years 16 days ago
Fast and effective histogram construction
Histogram construction or sequence segmentation is a basic task with applications in database systems, information retrieval, and knowledge management. Its aim is to approximate a...
Felix Halim, Panagiotis Karras, Roland H. C. Yap
ISAAC
2009
Springer
147views Algorithms» more  ISAAC 2009»
16 years 16 days ago
Computing a Smallest Multi-labeled Phylogenetic Tree from Rooted Triplets
Abstract. We investigate the computational complexity of a new combinatorial problem of inferring a smallest possible multi-labeled phylogenetic tree (MUL tree) which is consistent...
Sylvain Guillemot, Jesper Jansson, Wing-Kin Sung
PG
2007
IEEE
16 years 7 days ago
Fogshop: Real-Time Design and Rendering of Inhomogeneous, Single-Scattering Media
We describe a new, analytic approximation to the airlight integral from scattering media whose density is modeled as a sum of Gaussians. The approximation supports real-time rende...
Kun Zhou, Qiming Hou, Minmin Gong, John Snyder, Ba...
ICDCS
2006
IEEE
16 years 15 hour ago
Fault-Tolerant Clustering in Ad Hoc and Sensor Networks
In this paper, we study distributed approximation algorithms for fault-tolerant clustering in wireless ad hoc and sensor networks. A k-fold dominating set of a graph G = (V, E) is...
Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer
TAPIA
2005
ACM
15 years 11 months ago
Computation of nonclassical shocks using a spacetime discontinuous Galerkin method
We present a numerical study for two systems of conservation laws using a spacetime discontinuous Galerkin (SDG) method with causal spacetime triangulations and the piecewise cons...
Katarina Jegdic