943 search results - page 133 / 189 » How should data structures and algorithms be taught |
123
Voted
ICDM
2009
IEEE
15 years 9 months ago
2009
IEEE
—Identification of nodes relevant to a given node in a relational network is a basic problem in network analysis with great practical importance. Most existing network analysis ...
171
Voted
ICASSP
2011
IEEE
14 years 6 months ago
2011
IEEE
We design two different strategies for computing the unknown content preferences in an online social network based on a small set of nodes in the corresponding social graph for wh...
117
click to vote
ICML
2005
IEEE
16 years 3 months ago
2005
IEEE
T ORDER REGRESSION (EXTENDED ABSTRACT) Kurt Driessensa Saso Dzeroskib a Department of Computer Science, University of Waikato, Hamilton, New Zealand (kurtd@waikato.ac.nz) b Departm...
125
Voted
PLDI
2006
ACM
15 years 8 months ago
2006
ACM
One common technique for preventing data races in multi-threaded programs is to ensure that all accesses to shared locations are consistently protected by a lock. We present a too...
101
click to vote
ICML
2004
IEEE
16 years 3 months ago
2004
IEEE
Many NLP tasks rely on accurately estimating word dependency probabilities P(w1|w2), where the words w1 and w2 have a particular relationship (such as verb-object). Because of the...