Sciweavers

8824 search results - page 366 / 1765
» On the Complexity of Real Functions
Sort
View
176
Voted
LPAR
2007
Springer
16 years 28 days ago
Decidable Fragments of Many-Sorted Logic
We investigate the possibility of developing a decidable logic which allows expressing a large variety of real world specifications. The idea is to define a decidable subset of m...
Aharon Abadi, Alexander Moshe Rabinovich, Mooly Sa...
ISEM
2006
91views more  ISEM 2006»
15 years 6 months ago
Computational experimentations in market and supply-chain co-design: a mixed agent approach
The synthetic environment for analysis and simulations (SEAS) is a computational experimentation environment that mimics real life economies, with multiple interlinked markets, mul...
Alok R. Chaturvedi, Shailendra Raj Mehta, Daniel R...
ICISC
2007
96views Cryptology» more  ICISC 2007»
15 years 8 months ago
Colliding Message Pair for 53-Step HAS-160
We present a collision attack on the hash function HAS-160 reduced to 53-steps. The attack has a complexity of about 235 hash computations. The attack is based on the work of Cho e...
Florian Mendel, Vincent Rijmen
ICDM
2009
IEEE
125views Data Mining» more  ICDM 2009»
16 years 1 months ago
A Fully Automated Method for Discovering Community Structures in High Dimensional Data
—Identifying modules, or natural communities, in large complex networks is fundamental in many fields, including social sciences, biological sciences and engineering. Recently s...
Jianhua Ruan
ICC
2007
IEEE
100views Communications» more  ICC 2007»
16 years 1 months ago
S.T.R.E.S.S. : Stress Testing and Reverse Engineering for System Security
— In modern wireless networks the functions included into layer II have to deal with complex problems, such as security and access control, that were previously demanded to upper...
Matteo Rosi, Leonardo Maccari, Romano Fantacci