Sciweavers

1469 search results - page 116 / 294
» Discretization of a Continuous Curve
Sort
View
ICDE
2007
IEEE
185views Database» more  ICDE 2007»
16 years 8 months ago
On k-Nearest Neighbor Searching in Non-Ordered Discrete Data Spaces
A k-nearest neighbor (k-NN) query retrieves k objects from a database that are considered to be the closest to a given query point. Numerous techniques have been proposed in the p...
Dashiell Kolbe, Qiang Zhu, Sakti Pramanik
CCA
2009
Springer
16 years 1 months ago
Real Computation with Least Discrete Advice: A Complexity Theory of Nonuniform Computability
It is folklore particularly in numerical and computer sciences that, instead of solving some general problem f : A → B, additional structural information about the input x ∈ A ...
Martin Ziegler
ALGORITHMICA
2006
139views more  ALGORITHMICA 2006»
15 years 6 months ago
CONQUEST: A Coarse-Grained Algorithm for Constructing Summaries of Distributed Discrete Datasets
Abstract. In this paper we present a coarse-grained parallel algorithm, CONQUEST, for constructing boundederror summaries of high-dimensional binary attributed data in a distribute...
Jie Chi, Mehmet Koyutürk, Ananth Grama
WSC
2000
15 years 8 months ago
Use of discrete event simulation to validate an agent based scheduling engine
This paper discusses the use of simulation in a new context. Most often QUEST is viewed as a stand-alone simulation tool to analyze and understand shop floor behavior. It has rare...
Shubhabrata Biswas, Sara Merchawi
ICCV
2003
IEEE
16 years 8 months ago
Multiclass Spectral Clustering
We propose a principled account on multiclass spectral clustering. Given a discrete clustering formulation, we first solve a relaxed continuous optimization problem by eigendecomp...
Stella X. Yu, Jianbo Shi