Sciweavers

3946 search results - page 382 / 790
» The computational complexity of choice sets
Sort
View
IEEESCC
2009
IEEE
15 years 5 months ago
Theoretical Framework for Eliminating Redundancy in Workflows
In this paper we look at combining and compressing a set of workflows, such that computation can be minimized. In this context, we look at two novel theoretical problems with appl...
Dhrubajyoti Saha, Abhishek Samanta, Smruti R. Sara...
200
Voted
ATAL
2006
Springer
15 years 11 months ago
Examining DCSP coordination tradeoffs
Distributed Constraint Satisfaction Problems (DCSPs) provide a model to capture a broad range of cooperative multiagent problem solving settings. Researchers have generally propos...
Michael Benisch, Norman M. Sadeh
ECCV
2006
Springer
16 years 9 months ago
A Learning Based Approach for 3D Segmentation and Colon Detagging
Abstract. Foreground and background segmentation is a typical problem in computer vision and medical imaging. In this paper, we propose a new learning based approach for 3D segment...
Zhuowen Tu, Xiang Zhou, Dorin Comaniciu, Luca Bogo...
GCC
2007
Springer
16 years 1 months ago
Image Filtering on .NET-based Desktop Grids
Image filtering is the use of computer graphics algorithms to enhance the quality of digital images or to extract information about their content. However rendering very large siz...
Christian Vecchiola, Krishna Nadiminti, Rajkumar B...
UIC
2007
Springer
16 years 1 months ago
Context-Aware Service Composition for Mobile Network Environments
Recent advances in wireless and mobile networking technology pose a new set of requirements and challenges that are not previously thought of, when it comes to smart space middlewa...
Choonhwa Lee, Sunghoon Ko, Seungjae Lee, Wonjun Le...