Sciweavers

2593 search results - page 371 / 519
» Algorithms and Data Structures for Computer Topology
Sort
View
COMPGEOM
2010
ACM
15 years 11 months ago
A kinetic triangulation scheme for moving points in the plane
We present a simple randomized scheme for triangulating a set P of n points in the plane, and construct a kinetic data structure which maintains the triangulation as the points of...
Haim Kaplan, Natan Rubin, Micha Sharir
CIVR
2009
Springer
146views Image Analysis» more  CIVR 2009»
16 years 28 days ago
Web news categorization using a cross-media document graph
In this paper we propose a multimedia categorization framework that is able to exploit information across different parts of a multimedia document (e.g., a Web page, a PDF, a Micr...
José Iria, Fabio Ciravegna, João Mag...
KDD
2010
ACM
224views Data Mining» more  KDD 2010»
15 years 10 months ago
Multi-label learning by exploiting label dependency
In multi-label learning, each training example is associated with a set of labels and the task is to predict the proper label set for the unseen example. Due to the tremendous (ex...
Min-Ling Zhang, Kun Zhang
PKDD
2010
Springer
158views Data Mining» more  PKDD 2010»
15 years 4 months ago
Learning Sparse Gaussian Markov Networks Using a Greedy Coordinate Ascent Approach
In this paper, we introduce a simple but efficient greedy algorithm, called SINCO, for the Sparse INverse COvariance selection problem, which is equivalent to learning a sparse Ga...
Katya Scheinberg, Irina Rish
AAAI
2008
15 years 8 months ago
Clustering via Random Walk Hitting Time on Directed Graphs
In this paper, we present a general data clustering algorithm which is based on the asymmetric pairwise measure of Markov random walk hitting time on directed graphs. Unlike tradi...
Mo Chen, Jianzhuang Liu, Xiaoou Tang