Sciweavers

545 search results - page 85 / 109
» Estimating the Probability of Approximate Matches
Sort
View
SODA
2010
ACM
209views Algorithms» more  SODA 2010»
15 years 10 months ago
Counting Stars and Other Small Subgraphs in Sublinear Time
Detecting and counting the number of copies of certain subgraphs (also known as network motifs or graphlets), is motivated by applications in a variety of areas ranging from Biolo...
Mira Gonen, Dana Ron, Yuval Shavitt
SIAMCOMP
2010
174views more  SIAMCOMP 2010»
14 years 11 months ago
On the Complexity of Nash Equilibria and Other Fixed Points
We reexamine what it means to compute Nash equilibria and, more generally, what it means to compute a fixed point of a given Brouwer function, and we investigate the complexity o...
Kousha Etessami, Mihalis Yannakakis
106
Voted
ICML
2008
IEEE
16 years 1 months ago
Sample-based learning and search with permanent and transient memories
We present a reinforcement learning architecture, Dyna-2, that encompasses both samplebased learning and sample-based search, and that generalises across states during both learni...
David Silver, Martin Müller 0003, Richard S. ...
ICA
2012
Springer
13 years 8 months ago
On Revealing Replicating Structures in Multiway Data: A Novel Tensor Decomposition Approach
A novel tensor decomposition called pattern or P-decomposition is proposed to make it possible to identify replicating structures in complex data, such as textures and patterns in ...
Anh Huy Phan, Andrzej Cichocki, Petr Tichavsk&yacu...
BIOINFORMATICS
2006
142views more  BIOINFORMATICS 2006»
15 years 21 days ago
Intervention in a family of Boolean networks
Motivation: Intervention in a gene regulatory network is used to avoid undesirable states, such as those associated with a disease. Several types of intervention have been studied...
Ashish Choudhary, Aniruddha Datta, Michael L. Bitt...