Sciweavers

2814 search results - page 213 / 563
» Competitive Analysis of Distributed Algorithms
Sort
View
SIGMOD
2008
ACM
157views Database» more  SIGMOD 2008»
16 years 27 days ago
CRD: fast co-clustering on large datasets utilizing sampling-based matrix decomposition
The problem of simultaneously clustering columns and rows (coclustering) arises in important applications, such as text data mining, microarray analysis, and recommendation system...
Feng Pan, Xiang Zhang, Wei Wang 0010
COMPGEOM
1995
ACM
15 years 4 months ago
A Comparison of Sequential Delaunay Triangulation Algorithms
This paper presents an experimental comparison of a number of different algorithms for computing the Deluanay triangulation. The algorithms examined are: Dwyer’s divide and conq...
Peter Su, Robert L. (Scot) Drysdale III
SIGIR
2003
ACM
15 years 6 months ago
Collaborative filtering via gaussian probabilistic latent semantic analysis
Collaborative filtering aims at learning predictive models of user preferences, interests or behavior from community data, i.e. a database of available user preferences. In this ...
Thomas Hofmann
114
Voted
ISI
2003
Springer
15 years 6 months ago
Authorship Analysis in Cybercrime Investigation
Criminals have been using the Internet to distribute a wide range of illegal materials globally in an anonymous manner, making criminal identity tracing difficult in the cybercrime...
Rong Zheng, Yi Qin, Zan Huang, Hsinchun Chen
UAI
1998
15 years 2 months ago
Structured Reachability Analysis for Markov Decision Processes
Recent research in decision theoretic planning has focussedon making the solution of Markov decision processes (MDPs) more feasible. We develop a family of algorithms for structur...
Craig Boutilier, Ronen I. Brafman, Christopher W. ...