Sciweavers

1027 search results - page 108 / 206
» Callgraph properties of executables
Sort
View
135
Voted
BCS
2008
15 years 5 months ago
A Hardware Relaxation Paradigm for Solving NP-Hard Problems
Digital circuits with feedback loops can solve some instances of NP-hard problems by relaxation: the circuit will either oscillate or settle down to a stable state that represents...
Paul Cockshott, Andreas Koltes, John O'Donnell, Pa...
111
Voted
AAAI
2004
15 years 5 months ago
Shortest Path Discovery Problems: A Framework, Algorithms and Experimental Results
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 ...
Csaba Szepesvári
131
Voted
DBSEC
2004
91views Database» more  DBSEC 2004»
15 years 5 months ago
Implementing Real-Time Update of Access Control Policies
Real-time update of access control policies, that is, updating policies while they are in effect and enforcing the changes immediately, is necessary for many security-critical appl...
Indrakshi Ray, Tai Xin
112
Voted
ECIR
2006
Springer
15 years 5 months ago
An Efficient Computation of the Multiple-Bernoulli Language Model
Abstract. The Multiple Bernoulli (MB) Language Model has been generally considered too computationally expensive for practical purposes and superseded by the more efficient multino...
Leif Azzopardi, David E. Losada
118
Voted
ISTA
2003
15 years 5 months ago
Formal Modeling of Communication Traces
: Development of distributed systems is complicated by the absence of reliable global timing, concurrency, and nondeterminism. To deal with these obstacles log files are produced b...
Sergiy Boroday, Hesham Hallal, Alexandre Petrenko,...