Sciweavers

2229 search results - page 103 / 446
» Comparative analysis of biclustering algorithms
Sort
View
190
Voted
IFIP
2010
Springer
14 years 11 months ago
Model Checking of Concurrent Algorithms: From Java to C
Concurrent software is difficult to verify. Because the thread schedule is not controlled by the application, testing may miss defects that occur under specific thread schedules. T...
Cyrille Artho, Masami Hagiya, Watcharin Leungwatta...
198
Voted
MEMETIC
2010
311views more  MEMETIC 2010»
14 years 11 months ago
Iterated local search with Powell's method: a memetic algorithm for continuous global optimization
In combinatorial solution spaces Iterated Local Search (ILS) turns out to be exceptionally successful. The question arises: is ILS also capable of improving the optimization proces...
Oliver Kramer
ICCV
2007
IEEE
16 years 6 months ago
Structure from Statistics - Unsupervised Activity Analysis using Suffix Trees
Models of activity structure for unconstrained environments are generally not available a priori. Recent representational approaches to this end are limited by their computational...
Raffay Hamid, Siddhartha Maddi, Aaron F. Bobick, I...
PERCOM
2006
ACM
16 years 4 months ago
Performance Analysis of Stealth DHT with Mobile Nodes
The advances in wireless networking and the consequent emergence of new applications that wireless networks increasingly support inevitably leads to low capability mobile nodes co...
Andrew MacQuire, Andrew Brampton, Idris A. Rai, La...
141
Voted
MIAR
2008
IEEE
15 years 11 months ago
A Surface-Based Fractal Information Dimension Method for Cortical Complexity Analysis
In this paper, we proposed a new surface-based fractal information dimension (FID) method to quantify the cortical complexity. Unlike the traditional box-counting method to measure...
Yuanchao Zhang, Jiefeng Jiang, Lei Lin, Feng Shi, ...