Sciweavers

2262 search results - page 38 / 453
» Points with large quadrant-depth
Sort
View
ICDE
2005
IEEE
156views Database» more  ICDE 2005»
16 years 1 months ago
Reverse Nearest Neighbors in Large Graphs
A reverse nearest neighbor (RNN) query returns the data objects that have a query point as their nearest neighbor (NN). Although such queries have been studied quite extensively in...
Man Lung Yiu, Dimitris Papadias, Nikos Mamoulis, Y...
DAWAK
2001
Springer
15 years 4 months ago
Determining the Convex Hull in Large Multidimensional Databases
Determiningthe convex hull ofa point set isa basic operation for many applications of pattern recognition, image processing, statistics, and data mining. Although the corresponding...
Christian Böhm, Hans-Peter Kriegel
SIAMSC
2008
198views more  SIAMSC 2008»
14 years 11 months ago
Model Reduction for Large-Scale Systems with High-Dimensional Parametric Input Space
A model-constrained adaptive sampling methodology is proposed for reduction of large-scale systems with high-dimensional parametric input spaces. Our model reduction method uses a ...
T. Bui-Thanh, Karen Willcox, Omar Ghattas
COMBINATORICS
2000
84views more  COMBINATORICS 2000»
14 years 11 months ago
A Note on the Asymptotic Behavior of the Heights in b-Tries for b Large
We study the limiting distribution of the height in a generalized trie in which external nodes are capable to store up to b items (the so called b-tries). We assume that such a tr...
Charles Knessl, Wojciech Szpankowski
JMLR
2010
108views more  JMLR 2010»
14 years 6 months ago
Tree Decomposition for Large-Scale SVM Problems
To handle problems created by large data sets, we propose a method that uses a decision tree to decompose a given data space and train SVMs on the decomposed regions. Although the...
Fu Chang, Chien-Yang Guo, Xiao-Rong Lin, Chi-Jen L...