1200 search results - page 54 / 240 » Marked Ancestor Problems |
101
Voted
ICML
2005
IEEE
16 years 1 months ago
2005
IEEE
We apply classic online learning techniques similar to the perceptron algorithm to the problem of learning a function defined on a graph. The benefit of our approach includes simp...
IPPS
2009
IEEE
15 years 7 months ago
2009
IEEE
Abstract—In this paper we consider the problem of constructing minimal cycle-breaking sets of turns for graphs that model communication networks, as a method to prevent deadlocks...
100
click to vote
COCO
2009
Springer
15 years 7 months ago
2009
Springer
We prove that poly-sized AC0 circuits cannot distinguish a poly-logarithmically independent distribution from the uniform one. This settles the 1990 conjecture by Linial and Nisan...
IDA
2009
Springer
15 years 7 months ago
2009
Springer
We consider a method for solving the permutation problem in blind source separation (BSS) by the frequency-domain independent component analysis (FD-ICA) by using phase linearity o...
102
click to vote
ISSRE
2008
IEEE
15 years 7 months ago
2008
IEEE
A critical problem facing today’s internet community is the increasing number of attacks exploiting flaws found in Web applications. This paper specifically targets input valida...