Sciweavers

5329 search results - page 997 / 1066
» The Weighted Majority Algorithm
Sort
View
CIKM
2008
Springer
15 years 4 months ago
Modeling hidden topics on document manifold
Topic modeling has been a key problem for document analysis. One of the canonical approaches for topic modeling is Probabilistic Latent Semantic Indexing, which maximizes the join...
Deng Cai, Qiaozhu Mei, Jiawei Han, Chengxiang Zhai
114
Voted
COCO
2005
Springer
130views Algorithms» more  COCO 2005»
15 years 4 months ago
Pseudorandom Bits for Constant Depth Circuits with Few Arbitrary Symmetric Gates
We exhibit an explicitly computable ‘pseudorandom’ generator stretching l bits into m(l) = lΩ(log l) bits that look random to constant-depth circuits of size m(l) with log m...
Emanuele Viola
126
Voted
CONEXT
2005
ACM
15 years 4 months ago
Location based placement of whole distributed systems
The high bandwidth and low latency of the modern internet has made possible the deployment of distributed computing platforms. The XenoServer platform provides a distributed compu...
David Spence, Jon Crowcroft, Steven Hand, Timothy ...
DAC
2005
ACM
15 years 4 months ago
Constraint-aware robustness insertion for optimal noise-tolerance enhancement in VLSI circuits
Reliability of nanometer circuits is becoming a major concern in today’s VLSI chip design due to interferences from multiple noise sources as well as radiation-induced soft erro...
Chong Zhao, Yi Zhao, Sujit Dey
150
Voted
DIALM
2008
ACM
179views Algorithms» more  DIALM 2008»
15 years 4 months ago
Distance graphs: from random geometric graphs to Bernoulli graphs and between
A random geometric graph G(n, r) is a graph resulting from placing n points uniformly at random on the unit area disk, and connecting two points iff their Euclidean distance is at ...
Chen Avin