• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 10,118
Next 10 →

A Singular Value Thresholding Algorithm for Matrix Completion

by Jian-Feng Cai, Emmanuel J. Candès, Zuowei Shen , 2008
"... This paper introduces a novel algorithm to approximate the matrix with minimum nuclear norm among all matrices obeying a set of convex constraints. This problem may be understood as the convex relaxation of a rank minimization problem, and arises in many important applications as in the task of reco ..."
Abstract - Cited by 555 (22 self) - Add to MetaCart
-to-implement algorithm that is extremely efficient at addressing problems in which the optimal solution has low rank. The algorithm is iterative and produces a sequence of matrices {X k, Y k} and at each step, mainly performs a soft-thresholding operation on the singular values of the matrix Y k. There are two

A Threshold of ln n for Approximating Set Cover

by Uriel Feige - JOURNAL OF THE ACM , 1998
"... Given a collection F of subsets of S = f1; : : : ; ng, set cover is the problem of selecting as few as possible subsets from F such that their union covers S, and max k-cover is the problem of selecting k subsets from F such that their union has maximum cardinality. Both these problems are NP-har ..."
Abstract - Cited by 776 (5 self) - Add to MetaCart
-hard. We prove that (1 \Gamma o(1)) ln n is a threshold below which set cover cannot be approximated efficiently, unless NP has slightly superpolynomial time algorithms. This closes the gap (up to low order terms) between the ratio of approximation achievable by the greedy algorithm (which is (1 \Gamma

Ultra-low Threshold and Ultra-high

by I Contract, No. N--c , 1988
"... I i The views and conclusions contained in this document are those of the authors and should not be interpreted as necessarily representing the official policies, either expressed or implied, of the Defense,, ..."
Abstract - Add to MetaCart
I i The views and conclusions contained in this document are those of the authors and should not be interpreted as necessarily representing the official policies, either expressed or implied, of the Defense,,

Low Threshold CMOS Circuits with Low Standby Current

by Mircea R. Stan - in International Symposium on Low Power Electronics and Design , 1998
"... Multi-Voltage CMOS (MVCMOS) is a design methodology for very low power supply voltages that uses low-threshold transistors in series with the supply rails. The control voltages on the gating transistors need to be outside of the Vdd - Vss range (hence the name MVCMOS) in order to reduce the standby ..."
Abstract - Cited by 9 (2 self) - Add to MetaCart
Multi-Voltage CMOS (MVCMOS) is a design methodology for very low power supply voltages that uses low-threshold transistors in series with the supply rails. The control voltages on the gating transistors need to be outside of the Vdd - Vss range (hence the name MVCMOS) in order to reduce

Random Early Detection Gateways for Congestion Avoidance.

by Sally Floyd , Van Jacobson - IEEELACM Transactions on Networking, , 1993
"... Abstract-This paper presents Random Early Detection (RED) gateways for congestion avoidance in packet-switched networks. The gateway detects incipient congestion by computing the average queue size. The gateway could notify connections of congestion either by dropping packets arriving at the gatewa ..."
Abstract - Cited by 2716 (31 self) - Add to MetaCart
at the gateway or by setting a bit in packet headers. When the average queue size exceeds a preset threshold, the gateway drops or marks each arriving packet with a certain probability, where the exact probability is a function of the average queue size. RED gateways keep the average queue size low while

Loopy belief propagation for approximate inference: An empirical study. In:

by Kevin P Murphy , Yair Weiss , Michael I Jordan - Proceedings of Uncertainty in AI, , 1999
"... Abstract Recently, researchers have demonstrated that "loopy belief propagation" -the use of Pearl's polytree algorithm in a Bayesian network with loops -can perform well in the context of error-correcting codes. The most dramatic instance of this is the near Shannon-limit performanc ..."
Abstract - Cited by 676 (15 self) - Add to MetaCart
the convergence the more exact the approximation. • If the hidden nodes are binary, then thresholding the loopy beliefs is guaranteed to give the most probable assignment, even though the numerical value of the beliefs may be incorrect. This result only holds for nodes in the loop. In the max-product (or "

Dendritic low-threshold calcium currents in thalamic relay cells

by Alain Destexhe, Mike Neubig, Daniel Ulrich, John Huguenard - J. Neurosci , 1997
"... The low-threshold calcium current (I T) underlies burst generation in thalamocortical (TC) relay cells and plays a central role in the genesis of synchronized oscillations by thalamic circuits. Here we have combined in vitro recordings and computational modeling techniques to investigate the consequ ..."
Abstract - Cited by 74 (11 self) - Add to MetaCart
The low-threshold calcium current (I T) underlies burst generation in thalamocortical (TC) relay cells and plays a central role in the genesis of synchronized oscillations by thalamic circuits. Here we have combined in vitro recordings and computational modeling techniques to investigate

Learning Sparse Low-Threshold Linear Classifiers

by Sivan Sabato, Shai Shalev-Shwartz, Nathan Srebro, Daniel Hsu, Tong Zhang , 2015
"... We consider the problem of learning a non-negative linear classifier with a `1-norm of at most k, and a fixed threshold, under the hinge-loss. This problem generalizes the problem of learning a k-monotone disjunction. We prove that we can learn efficiently in this setting, at a rate which is linear ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
We consider the problem of learning a non-negative linear classifier with a `1-norm of at most k, and a fixed threshold, under the hinge-loss. This problem generalizes the problem of learning a k-monotone disjunction. We prove that we can learn efficiently in this setting, at a rate which is linear

The thalamic low-threshold Ca 2+ potential:

by Vincenzo Crunelli, Adam C. Errington, Stuart W. Hughes
"... a key determinant of the local and global dynamics of the slow (<1 Hz) sleep oscillation in thalamocortical networks ..."
Abstract - Add to MetaCart
a key determinant of the local and global dynamics of the slow (<1 Hz) sleep oscillation in thalamocortical networks

RAP ID REPORT Quantitative characterization of low-threshold

by David Andrew
"... mechanoreceptor inputs to lamina I spinoparabrachial neurons in the rat ..."
Abstract - Add to MetaCart
mechanoreceptor inputs to lamina I spinoparabrachial neurons in the rat
Next 10 →
Results 1 - 10 of 10,118
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University