Sciweavers

1664 search results - page 170 / 333
» Distance labeling in graphs
Sort
View
APIN
2005
107views more  APIN 2005»
15 years 6 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
ASUNAM
2009
IEEE
16 years 1 months ago
Social Network Model Based on Keyword Categorization
A user profile on an online social network is characterized by its profile entries (keywords). In this paper, we study the relationship between semantic similarity of user keywo...
Prantik Bhattacharyya, Ankush Garg, Shyhtsun Felix...
IROS
2006
IEEE
104views Robotics» more  IROS 2006»
16 years 17 days ago
Coverage Diameters of Polygons
— This paper formalizes and proposes an algorithm to compute coverage diameters of polygons in 2D. Roughly speaking, the coverage diameter of a polygon is the longest possible di...
Pawin Vongmasa, Attawith Sudsang
SPDP
1990
IEEE
15 years 10 months ago
A semi distributed load balancing scheme for large multicomputer systems
In this paper, we propose a semi distributed approach, for load balancing in large parallel and distributedsystems. Theproposedschemeisa twolevel hierarchical scheme which partiti...
Ishfaq Ahmad, Arif Ghafoor
CCCG
2009
15 years 7 months ago
Nucleation-free 3D rigidity
All known examples of generic 3D bar-and-joint frameworks where the distance between a non-edge pair is implied by the edges in the graph contain a rigid vertexinduced subgraph. I...
Jialong Cheng, Meera Sitharam, Ileana Streinu