Sciweavers

112 search results - page 22 / 23
» An Approximation Algorithm for Alphabet Indexing Problem
Sort
View
SIGMOD
2011
ACM
241views Database» more  SIGMOD 2011»
12 years 8 months ago
Neighborhood based fast graph search in large networks
Complex social and information network search becomes important with a variety of applications. In the core of these applications, lies a common and critical problem: Given a labe...
Arijit Khan, Nan Li, Xifeng Yan, Ziyu Guan, Supriy...
VLDB
2008
ACM
147views Database» more  VLDB 2008»
14 years 5 months ago
Tree-based partition querying: a methodology for computing medoids in large spatial datasets
Besides traditional domains (e.g., resource allocation, data mining applications), algorithms for medoid computation and related problems will play an important role in numerous e...
Kyriakos Mouratidis, Dimitris Papadias, Spiros Pap...
TMM
2010
270views Management» more  TMM 2010»
13 years 3 days ago
Sequence Multi-Labeling: A Unified Video Annotation Scheme With Spatial and Temporal Context
Abstract--Automatic video annotation is a challenging yet important problem for content-based video indexing and retrieval. In most existing works, annotation is formulated as a mu...
Yuanning Li, YongHong Tian, Ling-Yu Duan, Jingjing...
IIS
2003
13 years 6 months ago
Web Search Results Clustering in Polish: Experimental Evaluation of Carrot
Abstract. In this paper we consider the problem of web search results clustering in the Polish language, supporting our analysis with results acquired from an experimental system n...
Dawid Weiss, Jerzy Stefanowski
EDBT
2008
ACM
122views Database» more  EDBT 2008»
14 years 5 months ago
Semantic peer, here are the neighbors you want!
Peer Data Management Systems (PDMSs) have been introduced as a solution to the problem of large-scale sharing of semantically rich data. A PDMS consists of semantic peers connecte...
Wilma Penzo, Stefano Lodi, Federica Mandreoli, Ric...