Sciweavers

1887 search results - page 270 / 378
» An efficient search algorithm for partially ordered sets
Sort
View
MM
2004
ACM
99views Multimedia» more  MM 2004»
14 years 1 months ago
Locality preserving clustering for image database
It is important and challenging to make the growing image repositories easy to search and browse. Image clustering is a technique that helps in several ways, including image data ...
Xin Zheng, Deng Cai, Xiaofei He, Wei-Ying Ma, Xuey...
SIGMOD
2010
ACM
267views Database» more  SIGMOD 2010»
14 years 22 days ago
Processing proximity relations in road networks
Applications ranging from location-based services to multi-player online gaming require continuous query support to monitor, track, and detect events of interest among sets of mov...
Zhengdao Xu, Hans-Arno Jacobsen
WWW
2005
ACM
14 years 8 months ago
Partitioning of Web graphs by community topology
We introduce a stricter Web community definition to overcome boundary ambiguity of a Web community defined by Flake, Lawrence and Giles [2], and consider the problem of finding co...
Hidehiko Ino, Mineichi Kudo, Atsuyoshi Nakamura
ISCI
2008
116views more  ISCI 2008»
13 years 8 months ago
Discovery of maximum length frequent itemsets
The use of frequent itemsets has been limited by the high computational cost as well as the large number of resulting itemsets. In many real-world scenarios, however, it is often ...
Tianming Hu, Sam Yuan Sung, Hui Xiong, Qian Fu
CVPR
2006
IEEE
14 years 10 months ago
Robust Fragments-based Tracking using the Integral Histogram
We present a novel algorithm (which we call "FragTrack") for tracking an object in a video sequence. The template object is represented by multiple image fragments or pa...
Amit Adam, Ehud Rivlin, Ilan Shimshoni