Sciweavers

2215 search results - page 96 / 443
» Wide open spaces
Sort
View
AAAI
2000
14 years 11 months ago
Divide-and-Conquer Frontier Search Applied to Optimal Sequence Alignment
We present a new algorithm that reduces the space complexity of heuristic search. It is most effective for problem spaces that grow polynomially with problem size, but contain lar...
Richard E. Korf, Weixiong Zhang
ENTCS
2007
140views more  ENTCS 2007»
14 years 9 months ago
Admissible Representations of Probability Measures
In a recent paper, probabilistic processes are used to generate Borel probability measures on topological spaces X that are equipped with a representation in the sense of Type-2 T...
Matthias Schröder
PVLDB
2008
118views more  PVLDB 2008»
14 years 9 months ago
Column-store support for RDF data management: not all swans are white
This paper reports on the results of an independent evaluation of the techniques presented in the VLDB 2007 paper "Scalable Semantic Web Data Management Using Vertical Partit...
Lefteris Sidirourgos, Romulo Goncalves, Martin L. ...
ICPR
2008
IEEE
15 years 11 months ago
Unsupervised image embedding using nonparametric statistics
Embedding images into a low dimensional space has a wide range of applications: visualization, clustering, and pre-processing for supervised learning. Traditional dimension reduct...
Guobiao Mei, Christian R. Shelton
AAIM
2009
Springer
101views Algorithms» more  AAIM 2009»
15 years 4 months ago
Integer Polyhedra for Program Analysis
Polyhedra are widely used in model checking and abstract interpretation. Polyhedral analysis is effective when the relationships between variables are linear, but suffers from im...
Philip J. Charles, Jacob M. Howe, Andy King