Sciweavers

5675 search results - page 1107 / 1135
» Exploiting Chaos for Computation
Sort
View
SIGCOMM
2010
ACM
14 years 10 months ago
Circumventing censorship with collage
Oppressive regimes and even democratic governments restrict Internet access. Existing anti-censorship systems often require users to connect through proxies, but these systems are...
Sam Burnett, Nick Feamster, Santosh Vempala
SIGCOMM
2010
ACM
14 years 10 months ago
Design and implementation of an "approximate" communication system for wireless media applications
All practical wireless communication systems are prone to errors. At the symbol level such wireless errors have a well-defined structure: when a receiver decodes a symbol erroneou...
Sayandeep Sen, Syed Gilani, Shreesha Srinath, Step...
ICA
2010
Springer
14 years 10 months ago
Probabilistic Latent Tensor Factorization
We develop a probabilistic modeling framework for multiway arrays. Our framework exploits the link between graphical models and tensor factorization models and it can realize any ...
Y. Kenan Yilmaz, A. Taylan Cemgil
AAI
2007
132views more  AAI 2007»
14 years 10 months ago
Incremental Extraction of Association Rules in Applicative Domains
In recent years, the KDD process has been advocated to be an iterative and interactive process. It is seldom the case that a user is able to answer immediately with a single query...
Arianna Gallo, Roberto Esposito, Rosa Meo, Marco B...
BMCBI
2010
183views more  BMCBI 2010»
14 years 10 months ago
SING: Subgraph search In Non-homogeneous Graphs
Background: Finding the subgraphs of a graph database that are isomorphic to a given query graph has practical applications in several fields, from cheminformatics to image unders...
Raffaele Di Natale, Alfredo Ferro, Rosalba Giugno,...
« Prev « First page 1107 / 1135 Last » Next »