Sciweavers

93 search results - page 12 / 19
» Hard constraint satisfaction problems have hard gaps at loca...
Sort
View
SAC
2010
ACM
14 years 9 months ago
Graph-based verification of static program constraints
Software artifacts usually have static program constraints and these constraints should be satisfied in each reuse. In addition to this, the developers are also required to satisf...
Selim Ciraci, Pim van den Broek, Mehmet Aksit
MVA
1996
177views Computer Vision» more  MVA 1996»
14 years 11 months ago
An Adaptive Threshold Method for Gray Scale Character Images
Gray-scale document images are binarized in order to perform optical character recognition (OCR). To perform this binarization, a variety of techniques have been proposed for perf...
Ming Yu, Shinji Ozawa
AIR
2002
125views more  AIR 2002»
14 years 9 months ago
Interactive Critiquing for Catalog Navigation in E-Commerce
E-commerce sites can have large, essentially unbounded, catalogs. With large catalogs comes increasing difficulty for buyers in making use of standard search and browsing faciliti...
Robin D. Burke
ICLP
2005
Springer
15 years 3 months ago
Preference Reasoning
Abstract. Constraints and preferences are ubiquitous in real-life. Moreover, preferences can be of many kinds: qualitative, quantitative, conditional, positive or negative, to name...
Francesca Rossi
ICCAD
2003
IEEE
127views Hardware» more  ICCAD 2003»
15 years 6 months ago
Code Placement with Selective Cache Activity Minimization for Embedded Real-time Software Design
– Many embedded system designs usually impose (hard) read-time constraints on tasks. Thus, computing a tight upper bound of the worst case execution time (WCET) of a software is ...
Junhyung Um, Taewhan Kim