Sciweavers

5316 search results - page 174 / 1064
» Which Search Problems Are Random
Sort
View
SDM
2008
SIAM
164views Data Mining» more  SDM 2008»
15 years 5 months ago
Randomizing Social Networks: a Spectrum Preserving Approach
Understanding the general properties of real social networks has gained much attention due to the proliferation of networked data. The nodes in the network are the individuals and...
Xiaowei Ying, Xintao Wu
NIPS
2004
15 years 5 months ago
Using Random Forests in the Structured Language Model
In this paper, we explore the use of Random Forests (RFs) in the structured language model (SLM), which uses rich syntactic information in predicting the next word based on words ...
Peng Xu, Frederick Jelinek
128
Voted
SIAMDM
2002
124views more  SIAMDM 2002»
15 years 3 months ago
Scheduling Unrelated Machines by Randomized Rounding
We present a new class of randomized approximation algorithms for unrelated parallel machine scheduling problems with the average weighted completion time objective. The key idea i...
Andreas S. Schulz, Martin Skutella
ICDM
2009
IEEE
112views Data Mining» more  ICDM 2009»
15 years 10 months ago
Resolving Identity Uncertainty with Learned Random Walks
A pervasive problem in large relational databases is identity uncertainty which occurs when multiple entries in a database refer to the same underlying entity in the world. Relati...
Ted Sandler, Lyle H. Ungar, Koby Crammer
FPT
2005
IEEE
170views Hardware» more  FPT 2005»
15 years 9 months ago
High Quality Uniform Random Number Generation Through LUT Optimised Linear Recurrences
This paper describes a class of FPGA-specific uniform random number generators with a 2k −1 length period, which can provide k random bits per-cycle for the cost of k Lookup Ta...
David B. Thomas, Wayne Luk