Sciweavers

848 search results - page 117 / 170
» Randomness and the linear degrees of computability
Sort
View
ICALP
2011
Springer
14 years 8 months ago
Clustering with Local Restrictions
We study a family of graph clustering problems where each cluster has to satisfy a certain local requirement. Formally, let µ be a function on the subsets of vertices of a graph G...
Daniel Lokshtanov, Dániel Marx
JMLR
2006
389views more  JMLR 2006»
15 years 5 months ago
A Very Fast Learning Method for Neural Networks Based on Sensitivity Analysis
This paper introduces a learning method for two-layer feedforward neural networks based on sensitivity analysis, which uses a linear training algorithm for each of the two layers....
Enrique Castillo, Bertha Guijarro-Berdiñas,...
ICNP
2007
IEEE
15 years 11 months ago
FRASA: Feedback Retransmission Approximation for the Stability Region of Finite-User Slotted ALOHA
—FRASA, Feedback Retransmission Approximation for Slotted ALOHA, is proposed to study the stability region of finiteuser slotted ALOHA under collision channel. With FRASA, the s...
Ka-Hung Hui, On-Ching Yue, Wing Cheong Lau
JOC
2008
92views more  JOC 2008»
15 years 5 months ago
Cryptanalysis of an E0-like Combiner with Memory
In this paper, we study an E0-like combiner with memory as the keystream generator. First, we formulate a systematic and simple method to compute correlations of the FSM output seq...
Yi Lu 0002, Serge Vaudenay
147
Voted
SPAA
2005
ACM
15 years 11 months ago
Fast construction of overlay networks
An asynchronous algorithm is described for rapidly constructing an overlay network in a peer-to-peer system where all nodes can in principle communicate with each other directly t...
Dana Angluin, James Aspnes, Jiang Chen, Yinghua Wu...