Sciweavers

420 search results - page 58 / 84
» The One-Shot Similarity Kernel
Sort
View
PAKDD
2005
ACM
142views Data Mining» more  PAKDD 2005»
14 years 1 months ago
Dynamic Cluster Formation Using Level Set Methods
Density-based clustering has the advantages for (i) allowing arbitrary shape of cluster and (ii) not requiring the number of clusters as input. However, when clusters touch each o...
Andy M. Yip, Chris H. Q. Ding, Tony F. Chan
EMNLP
2008
13 years 9 months ago
Selecting Sentences for Answering Complex Questions
Complex questions that require inferencing and synthesizing information from multiple documents can be seen as a kind of topicoriented, informative multi-document summarization. I...
Yllias Chali, Shafiq R. Joty
EGITALY
2006
13 years 9 months ago
3D Data Segmentation Using a Non-Parametric Density Estimation Approach
In this paper, a new segmentation approach for sets of 3D unorganized points is proposed. The method is based on a clustering procedure that separates the modes of a non-parametri...
Umberto Castellani, Marco Cristani, Vittorio Murin...
PARCO
2003
13 years 9 months ago
Cache Memory Behavior of Advanced PDE Solvers
Three different partial differential equation (PDE) solver kernels are analyzed in respect to cache memory performance on a simulated shared memory computer. The kernels implement...
Dan Wallin, Henrik Johansson, Sverker Holmgren
COMGEO
2007
ACM
13 years 7 months ago
A package for exact kinetic data structures and sweepline algorithms
In this paper we present a package for implementing exact kinetic data structures built on objects which move along polynomial trajectories. We discuss how the package design was ...
Daniel Russel, Menelaos I. Karavelas, Leonidas J. ...