Sciweavers

626 search results - page 50 / 126
» When Can Formal Methods Make a Real Difference
Sort
View
SIGMETRICS
2008
ACM
115views Hardware» more  SIGMETRICS 2008»
15 years 3 months ago
Densification arising from sampling fixed graphs
During the past decade, a number of different studies have identified several peculiar properties of networks that arise from a diverse universe, ranging from social to computer n...
Pedram Pedarsani, Daniel R. Figueiredo, Matthias G...
GECCO
2007
Springer
181views Optimization» more  GECCO 2007»
15 years 9 months ago
ACOhg: dealing with huge graphs
Ant Colony Optimization (ACO) has been successfully applied to those combinatorial optimization problems which can be translated into a graph exploration. Artificial ants build s...
Enrique Alba, J. Francisco Chicano
TMC
2008
123views more  TMC 2008»
15 years 3 months ago
Learning Adaptive Temporal Radio Maps for Signal-Strength-Based Location Estimation
In wireless networks, a client's locations can be estimated using signal strength received from signal transmitters. Static fingerprint-based techniques are commonly used for ...
Jie Yin, Qiang Yang, Lionel M. Ni
MVA
2007
207views Computer Vision» more  MVA 2007»
15 years 4 months ago
View-invariant Human Action Recognition Based on Factorization and HMMs
of the fundamental challenges of human action recognition is accounting for the variability that arises during video capturing. For a specific action class, the 2D observations of...
Xi Li, Kazuhiro Fukui
SAS
2009
Springer
281views Formal Methods» more  SAS 2009»
16 years 3 months ago
A Verifiable, Control Flow Aware Constraint Analyzer for Bounds Check Elimination
The Java programming language requires that out-of-bounds array accesses produce runtime exceptions. In general, this requires a dynamic bounds check each time an array element is...
David Niedzielski, Jeffery von Ronne, Andreas Gamp...