Sciweavers

4523 search results - page 8 / 905
» Using randomization in the teaching of data structures and a...
Sort
View
DAGSTUHL
1996
13 years 9 months ago
Self-Organizing Data Structures
We survey results on self-organizing data structures for the search problem and concentrate on two very popular structures: the unsorted linear list, and the binary search tree. Fo...
Susanne Albers, Jeffery Westbrook
CIKM
2008
Springer
13 years 10 months ago
Academic conference homepage understanding using constrained hierarchical conditional random fields
We address the problem of academic conference homepage understanding for the Semantic Web. This problem consists of three labeling tasks - labeling conference function pages, func...
Xin Xin, Juanzi Li, Jie Tang, Qiong Luo
ISCA
2008
IEEE
136views Hardware» more  ISCA 2008»
13 years 8 months ago
A Randomized Queueless Algorithm for Breadth-First Search
First Come First Served is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems [28, 11], scheduling web ...
K. Subramani, Kamesh Madduri
TON
2002
86views more  TON 2002»
13 years 8 months ago
Efficient randomized web-cache replacement schemes using samples from past eviction times
The problem of document replacement in web caches has received much attention in recent research, and it has been shown that the eviction rule "replace the least recently used...
Konstantinos Psounis, Balaji Prabhakar
SDM
2012
SIAM
304views Data Mining» more  SDM 2012»
11 years 11 months ago
Fast Random Walk Graph Kernel
Random walk graph kernel has been used as an important tool for various data mining tasks including classification and similarity computation. Despite its usefulness, however, it...
U. Kang, Hanghang Tong, Jimeng Sun