Sciweavers

760 search results - page 31 / 152
» Algorithms for finding clique-transversals of graphs
Sort
View
CVPR
2010
IEEE
14 years 5 months ago
Finding Dots: Segmentation as Popping out Regions from Boundaries
Many applications need to segment out all small round regions in an image. This task of finding dots can be viewed as a region segmentation problem where the dots form one regio...
Elena Bernardis, Stella Yu
ALGORITHMICA
2006
161views more  ALGORITHMICA 2006»
13 years 8 months ago
The Expected Size of the Rule k Dominating Set
Dai, Li, and Wu proposed Rule k, a localized approximation algorithm that attempts to find a small connected dominating set in a graph. In this paper we consider the "average...
Jennie C. Hansen, Eric Schmutz, Li Sheng
JCDL
2009
ACM
127views Education» more  JCDL 2009»
14 years 3 months ago
Finding topic trends in digital libraries
We propose a generative model based on latent Dirichlet allocation for mining distinct topics in document collections by integrating the temporal ordering of documents into the ge...
Levent Bolelli, Seyda Ertekin, Ding Zhou, C. Lee G...
ICMCS
2007
IEEE
107views Multimedia» more  ICMCS 2007»
14 years 3 months ago
Finding Image Structure by Hierarchal Segmentation
Image segmentation has been studied for many years. But what factors influence segmentation results indeed? Why some images are easy to be handled while the others are not? In thi...
Bo Qiu, Daniel Racoceanu
SEMWEB
2005
Springer
14 years 2 months ago
Finding and Ranking Knowledge on the Semantic Web
Abstract. Swoogle helps software agents and knowledge engineers find Semantic Web knowledge encoded in RDF and OWL documents on the Web. Navigating such a Semantic Web on the Web ...
Li Ding, Rong Pan, Timothy W. Finin, Anupam Joshi,...