998 search results - page 18 / 200 » From Feasible Proofs to Feasible Computations |
NETWORKS
2010
13 years 5 months ago
2010
We consider a probabilistic model for the Steiner Tree problem. Under this model the problem is defined in a 2-stage setting over a first-stage complete weighted graph having it...
RAID
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. In order to detect a compromise of a running process based on it deviating from its program’s normal system-call behavior, an anomaly detector must first be trained wi...
ICCS
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. SymGrid-Par is a new framework for executing large computer algebra problems on computational Grids. We present the design of SymGrid-Par, which supports multiple compute...
ACL
2010
13 years 5 months ago
2010
We propose a corpus-based probabilistic framework to extract hidden common syntax across languages from non-parallel multilingual corpora in an unsupervised fashion. For this purp...
QSHINE
2005
IEEE
14 years 1 months ago
2005
IEEE
An extended depth-first-search (EDFS) algorithm is proposed to solve the multi-constrained path (MCP) problem in quality-of-service (QoS) routing, which is NP-Complete when the n...