1658 search results - page 149 / 332 » Learning Unknown Graphs |
105
Voted
CSFW
2004
IEEE
15 years 6 months ago
2004
IEEE
We present a new static analysis for reviewing the security of libraries for systems, such as JVMs or the CLR, that rely on stack inspection for access control. We describe its im...
104
Voted
AAAI
2004
15 years 4 months ago
2004
In this paper we introduce and study Shortest Path Discovery (SPD) problems, a generalization of shortest path problems: In SPD one is given a directed edgeweighted graph and the ...
111
Voted
AUTOMATICA
2008
15 years 2 months ago
2008
In this paper, we study the property of generic uniform observability for structured bilinear systems. More precisely, to check whether or not a structured bilinear system generic...
131
click to vote
DISOPT
2007
15 years 2 months ago
2007
We investigate the computational complexity of a combinatorial problem that arises in DNA sequencing by hybridization: The input consists of an integer together with a set S of wo...
139
Voted
ICML
2007
IEEE
16 years 3 months ago
2007
IEEE
A general framework is proposed for gradient boosting in supervised learning problems where the loss function is defined using a kernel over the output space. It extends boosting ...