Sciweavers

1163 search results - page 40 / 233
» Department of Redundancy Department
Sort
View
TCS
2002
15 years 5 months ago
Some permutation routing algorithms for low-dimensional hypercubes
Oblivious permutation routing in binary d-cubes has been well studied in the literature. In a permutation routing, each node initially contains a packet with a destination such th...
Frank K. Hwang, Y. C. Yao, Bhaskar DasGupta
AI
2011
Springer
15 years 14 days ago
Instantiating abstract argumentation with classical logic arguments: Postulates and properties
ating Abstract Argumentation with Classical Logic Arguments: Postulates and Properties Nikos Gorogiannisa , Anthony Hunterb,∗ aDepartment of Computer Science, Queen Mary, Univers...
Nikos Gorogiannis, Anthony Hunter
TCS
2011
15 years 10 days ago
Highly concurrent multi-word synchronization
d Abstract) Hagit Attiya and Eshcar Hillel Department of Computer Science, Technion The design of concurrent data structures is greatly facilitated by the availability of synchroni...
Hagit Attiya, Eshcar Hillel
WWW
2011
ACM
15 years 10 days ago
Growing parallel paths for entity-page discovery
In this paper, we use the structural and relational information on the Web to find entity-pages. Specifically, given a Web site and an entity-page (e.g., department and faculty ...
Tim Weninger, Fabio Fumarola, Cindy Xide Lin, Rick...
153
Voted
WSDM
2012
ACM
246views Data Mining» more  WSDM 2012»
14 years 29 days ago
Auralist: introducing serendipity into music recommendation
Recommendation systems exist to help users discover content in a large body of items. An ideal recommendation system should mimic the actions of a trusted friend or expert, produc...
Yuan Cao Zhang, Diarmuid Ó Séaghdha,...