Sciweavers

272 search results - page 54 / 55
» New directions in the introductory computer science curricul...
Sort
View
STOC
2009
ACM
96views Algorithms» more  STOC 2009»
14 years 7 months ago
MaxMin allocation via degree lower-bounded arborescences
We consider the problem of MaxMin allocation of indivisible goods. There are m items to be distributed among n players. Each player i has a nonnegative valuation pij for an item j...
MohammadHossein Bateni, Moses Charikar, Venkatesan...
EDBT
2009
ACM
302views Database» more  EDBT 2009»
14 years 1 months ago
RankClus: integrating clustering with ranking for heterogeneous information network analysis
As information networks become ubiquitous, extracting knowledge from information networks has become an important task. Both ranking and clustering can provide overall views on in...
Yizhou Sun, Jiawei Han, Peixiang Zhao, Zhijun Yin,...
JCDL
2006
ACM
151views Education» more  JCDL 2006»
14 years 28 days ago
Tagging of name records for genealogical data browsing
In this paper we present a method of parsing unstructured textual records briefly describing a person and their direct relatives, which we use in the construction of a browsing t...
Mike Perrow, David Barber
CIKM
2008
Springer
13 years 9 months ago
Probabilistic polyadic factorization and its application to personalized recommendation
Multiple-dimensional, i.e., polyadic, data exist in many applications, such as personalized recommendation and multipledimensional data summarization. Analyzing all the dimensions...
Yun Chi, Shenghuo Zhu, Yihong Gong, Yi Zhang
CORR
2006
Springer
108views Education» more  CORR 2006»
13 years 7 months ago
Two polygraphic presentations of Petri nets
: This document gives an algebraic and two polygraphic translations of Petri nets, all three providing an easier way to describe reductions and to identify some of them. The first ...
Yves Guiraud