Sciweavers

4523 search results - page 13 / 905
» Using randomization in the teaching of data structures and a...
Sort
View
ISPD
2012
ACM
289views Hardware» more  ISPD 2012»
12 years 4 months ago
Keep it straight: teaching placement how to better handle designs with datapaths
As technology scales and frequency increases, a new design style is emerging, referred to as hybrid designs, which contain a mixture of random logic and datapath standard cell com...
Samuel I. Ward, Myung-Chul Kim, Natarajan Viswanat...
ICDM
2010
IEEE
108views Data Mining» more  ICDM 2010»
13 years 6 months ago
Assessing Data Mining Results on Matrices with Randomization
Abstract--Randomization is a general technique for evaluating the significance of data analysis results. In randomizationbased significance testing, a result is considered to be in...
Markus Ojala
KDD
2007
ACM
244views Data Mining» more  KDD 2007»
14 years 8 months ago
A Recommender System Based on Local Random Walks and Spectral Methods
In this paper, we design recommender systems for weblogs based on the link structure among them. We propose algorithms based on refined random walks and spectral methods. First, w...
Zeinab Abbassi, Vahab S. Mirrokni
CORR
2011
Springer
215views Education» more  CORR 2011»
13 years 3 months ago
The total path length of split trees
We consider the model of random trees introduced by Devroye [SIAM J Comput 28, 409– 432, 1998]. The model encompasses many important randomized algorithms and data structures. T...
Nicolas Broutin, Cecilia Holmgren
COLING
2008
13 years 10 months ago
Word Sense Disambiguation for All Words using Tree-Structured Conditional Random Fields
We propose a supervised word sense disambiguation (WSD) method using tree-structured conditional random fields (TCRFs). By applying TCRFs to a sentence described as a dependency t...
Jun Hatori, Yusuke Miyao, Jun-ichi Tsujii