Sciweavers

699 search results - page 57 / 140
» Ranking of Object Summaries
Sort
View
SSDBM
2005
IEEE
159views Database» more  SSDBM 2005»
15 years 6 months ago
Clustering Moving Objects via Medoid Clusterings
Modern geographic information systems do not only have to handle static information but also dynamically moving objects. Clustering algorithms for these moving objects provide new...
Hans-Peter Kriegel, Martin Pfeifle
124
Voted
PVLDB
2010
139views more  PVLDB 2010»
14 years 7 months ago
Identifying the Most Influential Data Objects with Reverse Top-k Queries
Top-k queries are widely applied for retrieving a ranked set of the k most interesting objects based on the individual user preferences. As an example, in online marketplaces, cus...
Akrivi Vlachou, Christos Doulkeridis, Kjetil N&osl...
101
Voted
WWW
2007
ACM
16 years 1 months ago
Optimizing web search using social annotations
This paper explores the use of social annotations to improve web search. Nowadays, many services, e.g. del.icio.us, have been developed for web users to organize and share their f...
Shenghua Bao, Gui-Rong Xue, Xiaoyuan Wu, Yong Yu, ...
CPHYSICS
2006
182views more  CPHYSICS 2006»
15 years 17 days ago
MinFinder: Locating all the local minima of a function
A new stochastic clustering algorithm is introduced that aims to locate all the local minima of a multidimensional continuous and differentiable function inside a bounded domain. ...
Ioannis G. Tsoulos, Isaac E. Lagaris
103
Voted
AVSS
2009
IEEE
15 years 7 months ago
Clustered Synopsis of Surveillance Video
—Millions of surveillance cameras record video around the clock, producing huge video archives. Even when a video archive is known to include critical activities, finding them i...
Yael Pritch, Sarit Ratovitch, Avishai Hendel, Shmu...