Sciweavers

5244 search results - page 1049 / 1049
» When are two algorithms the same
Sort
View
IANDC
2008
141views more  IANDC 2008»
13 years 5 months ago
Graph connectivity, partial words, and a theorem of Fine and Wilf
The problem of computing periods in words, or finite sequences of symbols from a finite alphabet, has important applications in several areas including data compression, string se...
Francine Blanchet-Sadri, Deepak Bal, Gautam Sisodi...
CP
2006
Springer
13 years 7 months ago
Distributed Stable Matching Problems with Ties and Incomplete Lists
We consider the Stable Marriage Problem and the Stable Roommates Problem in presence of ties and incomplete preference lists. They can be solved by centralized algorithms, but this...
Ismel Brito, Pedro Meseguer
WWW
2009
ACM
14 years 6 months ago
Collaborative filtering for orkut communities: discovery of user latent behavior
Users of social networking services can connect with each other by forming communities for online interaction. Yet as the number of communities hosted by such websites grows over ...
WenYen Chen, Jon-Chyuan Chu, Junyi Luan, Hongjie B...
WWW
2006
ACM
14 years 6 months ago
Detecting online commercial intention (OCI)
Understanding goals and preferences behind a user's online activities can greatly help information providers, such as search engine and E-Commerce web sites, to personalize c...
Honghua (Kathy) Dai, Lingzhi Zhao, Zaiqing Nie, Ji...
« Prev « First page 1049 / 1049 Last » Next »