4761 search results - page 579 / 953 » Generalizing Boundary Points |
179
click to vote
COMPGEOM
2003
ACM
16 years 1 days ago
2003
ACM
We develop cache-oblivious data structures for orthogonal range searching, the problem of finding all T points in a set of N points in Êd lying in a query hyper-rectangle. Cache...
166
click to vote
ATAL
2003
Springer
16 years 1 days ago
2003
Springer
This paper examines a method of clustering within a fully decentralized multi-agent system. Our goal is to group agents with similar objectives or data, as is done in traditional ...
183
click to vote
ICCS
2003
Springer
16 years 8 hour ago
2003
Springer
The paper presents a theory for modeling flow in anisotropic, viscous rock. This theory has originally been developed for the simulation of large deformation processes including t...
236
click to vote
COMPGEOM
2010
ACM
15 years 12 months ago
2010
ACM
The best known upper bound on the number of topological changes in the Delaunay triangulation of a set of moving points in R2 is (nearly) cubic, even if each point is moving with ...
213
click to vote
CIKM
2009
Springer
15 years 10 months ago
2009
Springer
Feature weighting or selection is a crucial process to identify an important subset of features from a data set. Removing irrelevant or redundant features can improve the generali...