Sciweavers

507 search results - page 81 / 102
» Computing Sparse Multiples of Polynomials
Sort
View
STOC
1993
ACM
123views Algorithms» more  STOC 1993»
13 years 11 months ago
Constructing small sample spaces satisfying given constraints
Abstract. The subject of this paper is nding small sample spaces for joint distributions of n discrete random variables. Such distributions are often only required to obey a certa...
Daphne Koller, Nimrod Megiddo
KDD
2009
ACM
191views Data Mining» more  KDD 2009»
14 years 8 months ago
Efficient methods for topic model inference on streaming document collections
Topic models provide a powerful tool for analyzing large text collections by representing high dimensional data in a low dimensional subspace. Fitting a topic model given a set of...
Limin Yao, David M. Mimno, Andrew McCallum
NIPS
2000
13 years 9 months ago
Learning Winner-take-all Competition Between Groups of Neurons in Lateral Inhibitory Networks
It has long been known that lateral inhibition in neural networks can lead to a winner-take-all competition, so that only a single neuron is active at a steady state. Here we show...
Xiaohui Xie, Richard H. R. Hahnloser, H. Sebastian...
FGCS
2007
90views more  FGCS 2007»
13 years 7 months ago
Dual-Level Key Management for secure grid communication in dynamic and hierarchical groups
Grid computing is a newly developed technology for complex systems with large-scale resource sharing and multi-institutional collaboration. The prominent feature of grid computing...
Xukai Zou, Yuan-Shun Dai, Xiang Ran
WIOPT
2010
IEEE
13 years 6 months ago
Cooperative diversity routing in wireless networks
—In this paper, we explore physical layer cooperative communication in order to design network layer routing algorithms that are energy efficient. We assume each node in the net...
Mostafa Dehghan, Majid Ghaderi, Dennis Goeckel