Sciweavers

315 search results - page 17 / 63
» Better Approximation of Betweenness Centrality
Sort
View
SSD
2007
Springer
243views Database» more  SSD 2007»
14 years 2 months ago
Continuous Medoid Queries over Moving Objects
In the k-medoid problem, given a dataset P, we are asked to choose k points in P as the medoids. The optimal medoid set minimizes the average Euclidean distance between the points ...
Stavros Papadopoulos, Dimitris Sacharidis, Kyriako...
ICIP
2009
IEEE
14 years 9 months ago
Modified Grabcut For Unsupervised Object Segmentation
We propose a fully automated variation of the GrabCut technique for segmenting comparatively simple images with little variation in background colour and relatively high contrast ...
PAKDD
2009
ACM
157views Data Mining» more  PAKDD 2009»
14 years 1 months ago
Analysis of Variational Bayesian Matrix Factorization
Abstract. Recently, the variational Bayesian approximation was applied to probabilistic matrix factorization and shown to perform very well in experiments. However, its good perfor...
Shinichi Nakajima, Masashi Sugiyama
ICNP
2000
IEEE
14 years 1 months ago
A Topology-Independent Fair Queueing Model in Ad Hoc Wireless Networks
Fair queueing of rate and delay-sensitive packet flows in a shared-medium, multihop wireless network remains largely unaddressed because of the unique design issues such as locat...
Haiyun Luo, Songwu Lu
SODA
2003
ACM
131views Algorithms» more  SODA 2003»
13 years 10 months ago
Zonotopes as bounding volumes
Zonotopes are centrally symmetric polytopes with a very special structure: they are the Minkowski sum of line segments. In this paper we propose to use zonotopes as bounding volum...
Leonidas J. Guibas, An Nguyen, Li Zhang