Sciweavers

2489 search results - page 359 / 498
» On the Subgroup Distance Problem
Sort
View
136
Voted
SMA
2008
ACM
110views Solid Modeling» more  SMA 2008»
15 years 3 months ago
Probabilistic model of triangulation
This paper analyses the probability that randomly deployed sensor nodes triangulate any point within the target area. Its major result is the probability of triangulation for any p...
Xiaoyun Li, David K. Hunter
TALG
2008
67views more  TALG 2008»
15 years 3 months ago
Structure and linear-time recognition of 4-leaf powers
A graph G is the k-leaf power of a tree T if its vertices are leaves of T such that two vertices are adjacent in G if and only if their distance in T is at most k. Then T is a k-le...
Andreas Brandstädt, Van Bang Le, R. Sritharan
APIN
2005
107views more  APIN 2005»
15 years 3 months ago
Multi-Instance Learning Based Web Mining
In multi-instance learning, the training set comprises labeled bags that are composed of unlabeled instances, and the task is to predict the labels of unseen bags. In this paper, ...
Zhi-Hua Zhou, Kai Jiang, Ming Li
TKDE
2008
162views more  TKDE 2008»
15 years 3 months ago
Continuous k-Means Monitoring over Moving Objects
Given a dataset P, a k-means query returns k points in space (called centers), such that the average squared distance between each point in P and its nearest center is minimized. S...
Zhenjie Zhang, Yin Yang, Anthony K. H. Tung, Dimit...
211
Voted
JPDC
2007
138views more  JPDC 2007»
15 years 3 months ago
Distributed computation of the knn graph for large high-dimensional point sets
High-dimensional problems arising from robot motion planning, biology, data mining, and geographic information systems often require the computation of k nearest neighbor (knn) gr...
Erion Plaku, Lydia E. Kavraki