Sciweavers

1200 search results - page 54 / 240
» Marked Ancestor Problems
Sort
View
ICML
2005
IEEE
14 years 10 months ago
Online learning over graphs
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...
Mark Herbster, Massimiliano Pontil, Lisa Wainer
IPPS
2009
IEEE
14 years 4 months ago
Deadlock prevention by turn prohibition in interconnection networks
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...
Lev B. Levitin, Mark G. Karpovsky, Mehmet Mustafa
COCO
2009
Springer
96views Algorithms» more  COCO 2009»
14 years 4 months ago
Poly-logarithmic Independence Fools AC0 Circuits
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...
Mark Braverman
IDA
2009
Springer
14 years 4 months ago
Estimating Phase Linearity in the Frequency-Domain ICA Demixing Matrix
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...
Keisuke Toyama, Mark D. Plumbley
ISSRE
2008
IEEE
14 years 4 months ago
Automated Fix Generator for SQL Injection Attacks
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...
Fred Dysart, Mark Sherriff