4539 search results - page 466 / 908 » Approaches to Compute Workflow Complexity |
222
click to vote
IEEEMSP
2002
IEEE
15 years 11 months ago
2002
IEEE
—This paper presents an operational rate-distortion (ORD) optimal approach for skeleton-based boundary encoding. The boundary information is first decomposed into skeleton and di...
170
click to vote
INFOCOM
2002
IEEE
15 years 11 months ago
2002
IEEE
—Modern Personal Digital Assistant (PDA) architectures often utilize a wholesale data transfer protocol known as “slow sync” for synchronizing PDAs with Personal Computers (P...
181
click to vote
VISUALIZATION
2002
IEEE
15 years 11 months ago
2002
IEEE
This paper introduces a method for smoothing complex, noisy surfaces, while preserving (and enhancing) sharp, geometric features. It has two main advantages over previous approach...
183
click to vote
ICPP
1999
IEEE
15 years 11 months ago
1999
IEEE
On-line transaction processing exhibits poor memory behavior in high-end multiprocessor servers because of complex sharing patterns and substantial interaction between the databas...
175
click to vote
STACS
1999
Springer
15 years 11 months ago
1999
Springer
Abstract. We advocate to analyze the average complexity of learning problems. An appropriate framework for this purpose is introduced. Based on it we consider the problem of learni...