Sciweavers

1646 search results - page 118 / 330
» fast 2007
Sort
View
MICCAI
2007
Springer
16 years 4 months ago
Towards an Identification of Tumor Growth Parameters from Time Series of Images
In cancer treatment, understanding the aggressiveness of the tumor is essential in therapy planning and patient follow-up. In this article, we present a novel method for quantifyin...
Ender Konukoglu, Olivier Clatz, Pierre-Yves Bondia...
CAAN
2007
Springer
15 years 10 months ago
Improving Topological Routing in N2R Networks
Topological routing is basically table free, and allows for very fast restoration and thus a high level of reliability in communication. It has already been satisfactorily proposed...
José M. Gutiérrez López, Rub&...
152
Voted
IESS
2007
Springer
110views Hardware» more  IESS 2007»
15 years 10 months ago
Run-Time efficient Feasibility Analysis of Uni-Processor Systems with Static Priorities
: The performance of feasibility tests is crucial in many applications. When using feasibility tests online only a limited amount of analysis time is available. Run-time efficiency...
Karsten Albers, Frank Bodmann, Frank Slomka
118
Voted
SACRYPT
2007
Springer
151views Cryptology» more  SACRYPT 2007»
15 years 10 months ago
Collisions for 70-Step SHA-1: On the Full Cost of Collision Search
The diversity of methods for fast collision search in SHA-1 and similar hash functions makes a comparison of them difficult. The literature is at times very vague on this issue, wh...
Christophe De Cannière, Florian Mendel, Chr...
AAAI
2007
15 years 6 months ago
Data Structures for Generalised Arc Consistency for Extensional Constraints
Extensional (table) constraints are an important tool for attacking combinatorial problems with constraint programming. Recently there has been renewed interest in fast propagatio...
Ian P. Gent, Christopher Jefferson, Ian Miguel, Pe...