Sciweavers

5022 search results - page 83 / 1005
» Data structures and problem solving using Java
Sort
View
ICIP
2000
IEEE
15 years 11 months ago
Curve Evolution, Boundary-Value Stochastic Processes, the Mumford-Shah Problem, and Missing Data Applications
We present an estimation-theoretic approach to curve evolution for the Mumford-Shah problem. By viewing an active contour as the set of discontinuities in the Mumford-Shah problem...
Andy Tsai, Anthony J. Yezzi, Alan S. Willsky
CGO
2008
IEEE
15 years 4 months ago
Automatic array inlining in java virtual machines
Array inlining expands the concepts of object inlining to arrays. Groups of objects and arrays that reference each other are placed consecutively in memory so that their relative ...
Christian Wimmer, Hanspeter Mössenböck
ADMA
2005
Springer
189views Data Mining» more  ADMA 2005»
15 years 3 months ago
Parallel Genetic Algorithm and Parallel Simulated Annealing Algorithm for the Closest String Problem
In this paper, we design genetic algorithm and simulated annealing algorithm and their parallel versions to solve the Closest String problem. Our implementation and experiments sho...
Xuan Liu, Hongmei He, Ondrej Sýkora
CHI
2003
ACM
15 years 10 months ago
MiTAP for real users, real data, real problems
The MiTAP system was developed as an experimental prototype using human language technologies for monitoring disease outbreaks. The system provides timely, multi-lingual, global i...
Laurie E. Damianos, Steve Wohlever, Robyn Kozierok...
CORR
2010
Springer
162views Education» more  CORR 2010»
14 years 8 months ago
Backward Reachability of Array-based Systems by SMT solving: Termination and Invariant Synthesis
The safety of infinite state systems can be checked by a backward reachability procedure. For certain classes of systems, it is possible to prove the termination of the procedure ...
Silvio Ghilardi, Silvio Ranise