Sciweavers

151 search results - page 13 / 31
» A Cost Analysis of Solving the Amnesia Problems
Sort
View
DAC
1999
ACM
13 years 11 months ago
Exact Memory Size Estimation for Array Computations without Loop Unrolling
This paper presents a new algorithm for exact estimation of the minimum memory size required by programs dealing with array computations. Memory size is an important factor a ecti...
Ying Zhao, Sharad Malik
CVPR
2005
IEEE
14 years 9 months ago
Discriminant Analysis with Tensor Representation
In this paper, we present a novel approach to solving the supervised dimensionality reduction problem by encoding an image object as a general tensor of 2nd or higher order. First...
Shuicheng Yan, Dong Xu, Qiang Yang, Lei Zhang, Xia...
WDAG
2001
Springer
131views Algorithms» more  WDAG 2001»
13 years 12 months ago
The Complexity of Synchronous Iterative Do-All with Crashes
Abstract. The ability to cooperate on common tasks in a distributed setting is key to solving a broad range of computation problems ranging from distributed search such as SETI to ...
Chryssis Georgiou, Alexander Russell, Alexander A....
DAS
2006
Springer
13 years 11 months ago
Combining Multiple Classifiers for Faster Optical Character Recognition
Traditional approaches to combining classifiers attempt to improve classification accuracy at the cost of increased processing. They may be viewed as providing an accuracy-speed tr...
Kumar Chellapilla, Michael Shilman, Patrice Simard
ANOR
2007
151views more  ANOR 2007»
13 years 7 months ago
Distributed personnel scheduling - negotiation among scheduling agents
This paper introduces a model for Distributed Employee Timetabling Problems (DisETPs) and proposes a general architecture for solving DisETPs by using a Multi Agent System (MAS) pa...
Eliezer Kaplansky, Amnon Meisels