7197 search results - page 383 / 1440 » On the computational power of BlenX |
180
click to vote
PLDI
2010
ACM
16 years 4 months ago
2010
ACM
We define the reachability-bound problem to be the problem of finding a symbolic worst-case bound on the number of times a given control location inside a procedure is visited in ...
185
click to vote
CIE
2009
Springer
16 years 1 months ago
2009
Springer
We investigate the computing power of stateless multicounter machines with reversal-bounded counters. Such a machine has m-counters operating on a one-way input delimited by left a...
168
Voted
HPDC
2007
IEEE
16 years 1 months ago
2007
IEEE
With the evolution of technology, Grids cannot be considered any more solely as a federation of a modest number of powerful cluster computers. Trends show that future Grids will i...
171
Voted
ICPADS
2007
IEEE
16 years 1 months ago
2007
IEEE
- Due to the increasing complexity of scientific models, large-scale simulation tools often require a critical amount of computational power to produce results in a reasonable amou...
200
click to vote
IEEECGIV
2006
IEEE
16 years 27 days ago
2006
IEEE
The tracking of features in real-time video streams forms the integral part of many important applications in human-computer interaction and computer vision. Unfortunately trackin...