Sciweavers

15254 search results - page 51 / 3051
» A k
Sort
View
CORR
2008
Springer
167views Education» more  CORR 2008»
14 years 9 months ago
Fast k Nearest Neighbor Search using GPU
Statistical measures coming from information theory represent interesting bases for image and video processing tasks such as image retrieval and video object tracking. For example...
Vincent Garcia, Eric Debreuve, Michel Barlaud
HICSS
2009
IEEE
85views Biometrics» more  HICSS 2009»
15 years 4 months ago
Bounding the Size of k-Tuple Covers
Suppose there are n applications and n processors. A pair cover is a set S of one-to-one mappings (assignments) of the applications to the processors such that, for every pair (Ai...
Wolfgang W. Bein, Shahram Latifi, Linda Morales, I...
80
Voted
EPIA
2009
Springer
15 years 4 months ago
An Algorithm to Discover the k-Clique Cover in Networks
Abstract. In social network analysis, a k-clique is a relaxed clique, i.e., a kclique is a quasi-complete sub-graph. A k-clique in a graph is a sub-graph where the distance between...
Luís Cavique, Armando B. Mendes, Jorge M. A...
ICDCS
2008
IEEE
15 years 4 months ago
Distributed Connected Dominating Set Construction in Geometric k-Disk Graphs
In this paper, we study the problem of minimum connected dominating set in geometric k-disk graphs. This research is motivated by the problem of virtual backbone construction in w...
Kai Xing, Wei Cheng, E. K. Park, Shmuel Rotenstrei...
ICDM
2006
IEEE
127views Data Mining» more  ICDM 2006»
15 years 3 months ago
Optimal k-Anonymity with Flexible Generalization Schemes through Bottom-up Searching
In recent years, a major thread of research on kanonymity has focused on developing more flexible generalization schemes that produce higher-quality datasets. In this paper we in...
Tiancheng Li, Ninghui Li