Sciweavers

1085 search results - page 59 / 217
» Hug over a distance
Sort
View
PR
2010
144views more  PR 2010»
14 years 10 months ago
Classifying transformation-variant attributed point patterns
This paper presents a classification approach, where a sample is represented by a set of feature vectors called an attributed point pattern. Some attributes of a point are transf...
K. E. Dungan, L. C. Potter
KDD
2008
ACM
172views Data Mining» more  KDD 2008»
16 years 7 days ago
Structured metric learning for high dimensional problems
The success of popular algorithms such as k-means clustering or nearest neighbor searches depend on the assumption that the underlying distance functions reflect domain-specific n...
Jason V. Davis, Inderjit S. Dhillon
SSDBM
2008
IEEE
181views Database» more  SSDBM 2008»
15 years 6 months ago
Monitoring Aggregate k-NN Objects in Road Networks
Abstract. In recent years, there is an increasing need to monitor k nearest neighbor (k-NN) in a road network. There are existing solutions on either monitoring k-NN objects from a...
Lu Qin, Jeffrey Xu Yu, Bolin Ding, Yoshiharu Ishik...
EVOW
2009
Springer
14 years 9 months ago
The Dynamic Knapsack Problem Revisited: A New Benchmark Problem for Dynamic Combinatorial Optimisation
Abstract. In this paper we propose a new benchmark problem for dynamic combinatorial optimisation. Unlike most previous benchmarks, we focus primarily on the underlying dynamics of...
Philipp Rohlfshagen, Xin Yao
CVPR
2012
IEEE
13 years 2 months ago
Learning to segment dense cell nuclei with shape prior
We study the problem of segmenting multiple cell nuclei from GFP or Hoechst stained microscope images with a shape prior. This problem is encountered ubiquitously in cell biology ...
Xinghua Lou, Ullrich Köthe, Jochen Wittbrodt,...