Sciweavers

712 search results - page 116 / 143
» A mixture model for random graphs
Sort
View
ICALP
2011
Springer
12 years 11 months ago
On the Advice Complexity of the k-Server Problem
Competitive analysis is the established tool for measuring the output quality of algorithms that work in an online environment. Recently, the model of advice complexity has been in...
Hans-Joachim Böckenhauer, Dennis Komm, Rastis...
NIPS
2008
13 years 9 months ago
Natural Image Denoising with Convolutional Networks
We present an approach to low-level vision that combines two main ideas: the use of convolutional networks as an image processing architecture and an unsupervised learning procedu...
Viren Jain, H. Sebastian Seung
BMCBI
2006
163views more  BMCBI 2006»
13 years 7 months ago
Ensemble attribute profile clustering: discovering and characterizing groups of genes with similar patterns of biological featur
Background: Ensemble attribute profile clustering is a novel, text-based strategy for analyzing a userdefined list of genes and/or proteins. The strategy exploits annotation data ...
J. R. Semeiks, A. Rizki, Mina J. Bissell, I. Saira...
CPM
2011
Springer
283views Combinatorics» more  CPM 2011»
12 years 11 months ago
Frequent Submap Discovery
Combinatorial maps are nice data structures for modeling the topology of nD objects subdivided in cells (e.g., vertices, edges, faces, volumes, ...) by means of incidence and adjac...
Stéphane Gosselin, Guillaume Damiand, Chris...
ICDE
2008
IEEE
168views Database» more  ICDE 2008»
14 years 2 months ago
Index Design for Dynamic Personalized PageRank
Personalized PageRank, related to random walks with restarts and conductance in resistive networks, is a frequent search paradigm for graph-structured databases. While efficient ba...
Amit Pathak, Soumen Chakrabarti, Manish S. Gupta