Sciweavers

884 search results - page 135 / 177
» Algorithms for Implicit Deformable Models
Sort
View
147
Voted
VLDB
2004
ACM
134views Database» more  VLDB 2004»
15 years 7 months ago
Memory-Limited Execution of Windowed Stream Joins
We address the problem of computing approximate answers to continuous sliding-window joins over data streams when the available memory may be insufficient to keep the entire join...
Utkarsh Srivastava, Jennifer Widom
106
Voted
ICFP
2004
ACM
16 years 2 months ago
A sound (and complete) model of contracts
Even in statically typed languages it is useful to have certain invariants checked dynamically. Findler and Felleisen gave an algorithm for dynamically checking expressive higher-...
Matthias Blume, David A. McAllester
116
Voted
ICASSP
2009
IEEE
15 years 9 months ago
Multi-level non-rigid image registration using graph-cuts
Non-rigid image registration is widely used in medical image analysis and image processing. It remains a challenging research problem due to its smoothness requirement and high de...
Ronald W. K. So, Albert C. S. Chung
CANDC
2005
ACM
15 years 4 months ago
Computational schemes for biomimetic sculpture
A prototype system for the automatic evolution of biomimetic structures using structural automata is described and its utility for generating digital sculpture is demonstrated. Sc...
Brower Hatcher, Karl Aspelund, Andrew R. Willis, J...
154
Voted
PODC
2006
ACM
15 years 8 months ago
Self-stabilizing byzantine agreement
Byzantine agreement algorithms typically assume implicit initial state consistency and synchronization among the correct nodes and then operate in coordinated rounds of informatio...
Ariel Daliot, Danny Dolev