Sciweavers

331 search results - page 30 / 67
» Fast Matching for All Pairs Similarity Search
Sort
View
DEXA
2005
Springer
138views Database» more  DEXA 2005»
15 years 3 months ago
Full-Text and Structural XML Indexing on B+-Tree
XML query processing is one of the most active areas of database research. Although the main focus of past research has been the processing of structural XML queries, there are gro...
Toshiyuki Shimizu, Masatoshi Yoshikawa
AGENTS
1998
Springer
15 years 1 months ago
WebMate: A Personal Agent for Browsing and Searching
The World-Wide Web is developing very fast. Currently, nding useful information on the Web is a time consuming process. In this paper, we present WebMate, an agent that helps user...
Liren Chen, Katia P. Sycara
BIBE
2005
IEEE
126views Bioinformatics» more  BIBE 2005»
15 years 3 months ago
Highly Scalable and Accurate Seeds for Subsequence Alignment
We propose a method for finding seeds for the local alignment of two nucleotide sequences. Our method uses randomized algorithms to find approximate seeds. We present a dynamic ...
Abhijit Pol, Tamer Kahveci
SIGIR
2006
ACM
15 years 3 months ago
Unifying user-based and item-based collaborative filtering approaches by similarity fusion
Memory-based methods for collaborative filtering predict new ratings by averaging (weighted) ratings between, respectively, pairs of similar users or items. In practice, a large ...
Jun Wang, Arjen P. de Vries, Marcel J. T. Reinders
AAAI
2006
14 years 11 months ago
Computing Slater Rankings Using Similarities among Candidates
Voting (or rank aggregation) is a general method for aggregating the preferences of multiple agents. One important voting rule is the Slater rule. It selects a ranking of the alte...
Vincent Conitzer