Sciweavers

722 search results - page 106 / 145
» Efficient Generation of Prime Numbers
Sort
View
IJCAI
1993
13 years 9 months ago
Diagnosing and Solving Over-Determined Constraint Satisfaction Problems
Constraint relaxation is a frequently used technique for managing over-determined constraint satisfaction problems. A problem in constraint relaxation is the selection of the appr...
R. R. Bakker, F. Dikker, F. Tempelman, P. M. Wognu...
CORR
2010
Springer
74views Education» more  CORR 2010»
13 years 7 months ago
Data Partitioning for Parallel Entity Matching
Entity matching is an important and difficult step for integrating web data. To reduce the typically high execution time for matching we investigate how we can perform entity matc...
Toralf Kirsten, Lars Kolb, Michael Hartung, Anika ...
FGCS
2006
135views more  FGCS 2006»
13 years 7 months ago
Scaling applications to massively parallel machines using Projections performance analysis tool
Some of the most challenging applications to parallelize scalably are the ones that present a relatively small amount of computation per iteration. Multiple interacting performanc...
Laxmikant V. Kalé, Gengbin Zheng, Chee Wai ...
JCIT
2008
172views more  JCIT 2008»
13 years 7 months ago
Rough Wavelet Hybrid Image Classification Scheme
This paper introduces a new computer-aided classification system for detection of prostate cancer in Transrectal Ultrasound images (TRUS). To increase the efficiency of the comput...
Hala S. Own, Aboul Ella Hassanien
MP
2006
87views more  MP 2006»
13 years 7 months ago
Convexity and decomposition of mean-risk stochastic programs
Abstract. Traditional stochastic programming is risk neutral in the sense that it is concerned with the optimization of an expectation criterion. A common approach to addressing ri...
Shabbir Ahmed