Sciweavers

2080 search results - page 365 / 416
» Measuring empirical computational complexity
Sort
View
ISBMS
2010
Springer
15 years 8 months ago
A Point-Based Simulation Framework for Minimally Invasive Surgery
In this paper, we present a physically-based simulation framework to build up real-time Minimally invasive surgery (MIS) simulators using pointbased techniques. In our framework, s...
Bo Zhu, Lixu Gu, Xiaopeng Peng, Zhe Zhou
IDA
2010
Springer
15 years 8 months ago
A Framework for Path-Oriented Network Simplification
Abstract. We propose a generic framework and methods for simplification of large networks. The methods can be used to improve the understandability of a given network, to complemen...
Hannu Toivonen, Sébastien Mahler, Fang Zhou
FSE
2008
Springer
162views Cryptology» more  FSE 2008»
15 years 7 months ago
Collisions on SHA-0 in One Hour
At Crypto 2007, Joux and Peyrin showed that the boomerang attack, a classical tool in block cipher cryptanalysis, can also be very useful when analyzing hash functions. They applie...
Stéphane Manuel, Thomas Peyrin
BIOCOMP
2007
15 years 7 months ago
Quality-Based Similarity Search for Biological Sequence Databases
Low-Complexity Regions (LCRs) of biological sequences are the main source of false positives in similarity searches for biological sequence databases. We consider the problem of ï...
Xuehui Li, Tamer Kahveci
ICWN
2007
15 years 7 months ago
Comparing Agent Paradigms for Resource Management in Sensor Networks
— Management of power and other resources that effect field life is an important consideration in sensor networks. This paper presents and compares alternative agent paradigms ap...
Anish Anthony, Thomas C. Jannett