Sciweavers

2907 search results - page 47 / 582
» Presentations of Structures in Admissible Sets
Sort
View
JCAM
2010
116views more  JCAM 2010»
14 years 4 months ago
A vertex-based hierarchical slope limiter for p-adaptive discontinuous Galerkin methods
A new approach to slope limiting for discontinuous Galerkin methods on arbitrary meshes is introduced. A local Taylor basis is employed to express the approximate solution in term...
Dmitri Kuzmin
TNN
2010
143views Management» more  TNN 2010»
14 years 4 months ago
Using unsupervised analysis to constrain generalization bounds for support vector classifiers
Abstract--A crucial issue in designing learning machines is to select the correct model parameters. When the number of available samples is small, theoretical sample-based generali...
Sergio Decherchi, Sandro Ridella, Rodolfo Zunino, ...
JGTOOLS
2008
100views more  JGTOOLS 2008»
14 years 10 months ago
Proximity Cluster Trees
Hierarchical spatial data structures provide a means for organizing data for efficient processing. Most spatial data structures are optimized for performing queries, such as inters...
Elena Jakubiak Hutchinson, Sarah F. Frisken, Ronal...
JAIR
2010
160views more  JAIR 2010»
14 years 8 months ago
Constructing Reference Sets from Unstructured, Ungrammatical Text
Vast amounts of text on the Web are unstructured and ungrammatical, such as classified ads, auction listings, forum postings, etc. We call such text “posts.” Despite their in...
Matthew Michelson, Craig A. Knoblock
COMPGEOM
2009
ACM
15 years 4 months ago
Near-linear approximation algorithms for geometric hitting sets
Given a set system (X, R), the hitting set problem is to find a smallest-cardinality subset H ⊆ X, with the property that each range R ∈ R has a non-empty intersection with H...
Pankaj K. Agarwal, Esther Ezra, Micha Sharir