Sciweavers

7015 search results - page 1343 / 1403
» Approximation algorithms for co-clustering
Sort
View
JOIN
2007
91views more  JOIN 2007»
13 years 9 months ago
An Optimal Rebuilding Strategy for an Incremental Tree Problem
This paper is devoted to the following incremental problem. Initially, a graph and a distinguished subset of vertices, called initial group, are given. This group is connected by ...
Nicolas Thibault, Christian Laforest
TSP
2008
101views more  TSP 2008»
13 years 9 months ago
Bayesian Compressive Sensing
The data of interest are assumed to be represented as N-dimensional real vectors, and these vectors are compressible in some linear basis B, implying that the signal can be recons...
Shihao Ji, Ya Xue, Lawrence Carin
CPHYSICS
2004
87views more  CPHYSICS 2004»
13 years 9 months ago
Vlasov simulations on an adaptive phase-space grid
We introduce here a new method for the numerical resolution of the Vlasov equation on a phase space grid using an adaptive semi-Lagrangian method. The adaptivity is obtained throu...
Michael Gutnic, Matthieu Haefele, I. Paun, Eric So...
IDA
2002
Springer
13 years 8 months ago
Classification with sparse grids using simplicial basis functions
Recently we presented a new approach [20] to the classification problem arising in data mining. It is based on the regularization network approach but in contrast to other methods...
Jochen Garcke, Michael Griebel
COMGEO
1999
ACM
13 years 8 months ago
Multiresolution hierarchies on unstructured triangle meshes
The use of polygonal meshes for the representation of highly complex geometric objects has become the de facto standard in most computer graphics applications. Especially triangle...
Leif Kobbelt, Jens Vorsatz, Hans-Peter Seidel
« Prev « First page 1343 / 1403 Last » Next »