2200 search results - page 163 / 440 » Bloch's Constant is Computable |
166
click to vote
DATE
2009
IEEE
16 years 1 months ago
2009
IEEE
—In embedded computing we face a continuously growing algorithm complexity combined with a constantly rising number of applications running on a single system. Multi-core systems...
167
click to vote
WG
2009
Springer
16 years 1 months ago
2009
Springer
The Hamiltonian Cycle problem asks if an n-vertex graph G has a cycle passing through all vertices of G. This problem is a classic NP-complete problem. So far, finding an exact al...
151
click to vote
CSR
2009
Springer
16 years 1 months ago
2009
Springer
We consider the class of constant depth AND/OR circuits augmented with a layer of modular counting gates at the bottom layer, i.e AC0 ◦MODm circuits. We show that the following ...
168
click to vote
DSOM
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Nowadays, network load is constantly increasing and high-speed infrastructures (1-10Gbps) are becoming increasingly common. In this context, flow-based intrusion detecti...
177
click to vote
ESAW
2009
Springer
16 years 1 months ago
2009
Springer
As the number of information in the Internet constantly increases and the complexity of systems rapidly grows, locating and manipulating complex data has become a difficult task. W...