14518 search results - page 127 / 2904 » Two Problems for Sophistication |
CP
2011
Springer
12 years 10 months ago
2011
Springer
The distance between two graphs is usually defined by means of the size of a largest common subgraph. This common subgraph may be an induced subgraph, obtained by removing nodes, ...
ICA
2004
Springer
14 years 3 months ago
2004
Springer
In this paper, we consider independence property between a random process and its first derivative. Then, for linear mixtures, we show that cross-correlations between mixtures and...
AUSAI
2005
Springer
14 years 3 months ago
2005
Springer
Simulating a system of agents that navigate in a physical space is a challenging problem when the environment is sophisticated and the number of agents involved is large. We descr...
ATS
1998
IEEE
14 years 2 months ago
1998
IEEE
This paper aims at broadening the scope of hierarchical ATPG to the behavioral-level The main problem of using behavioral information for ATPG is the mismatch of timing models bet...
NDSS
1997
IEEE
14 years 2 months ago
1997
IEEE
This paper explores the problem of protecting a site on the Internet against hostile external Java applets while allowing trusted internal applets to run. With careful implementat...