3270 search results - page 254 / 654 » Approximate String Processing |
131
Voted
CGI
2006
IEEE
15 years 9 months ago
2006
IEEE
Abstract. A new adaptive tessellation method for general CatmullClark subdivision surfaces is presented. Development of the new method is based on the observation that optimum adap...
158
Voted
SIROCCO
2010
15 years 4 months ago
2010
We consider asynchronous message-passing systems in which some links are timely and processes may crash. Each run defines a timeliness graph among correct processes: (p, q) is an e...
125
Voted
ECCV
2002
Springer
16 years 5 months ago
2002
Springer
We address the issue of regularizing Osher and Rudin's shock filter, used for image deblurring, in order to allow processes that are more robust against noise. Previous soluti...
131
click to vote
FSTTCS
2006
Springer
15 years 7 months ago
2006
Springer
We propose a new approach to verification of probabilistic processes for which the model may not be available. We use a technique from Reinforcement Learning to approximate how far...
117
click to vote
STACS
2009
Springer
15 years 10 months ago
2009
Springer
We present a unified optimal semi-online algorithm for preemptive scheduling on uniformly related machines with the objective to minimize the makespan. This algorithm works for a...