Sciweavers

103 search results - page 15 / 21
» Consistency and Random Constraint Satisfaction Models
Sort
View
ICIP
1995
IEEE
15 years 11 months ago
On morphological openings and closings of signals in shaped noise
In recent work, we have shown that morphological openings and closings can be viewed as consistent MAP estimators of morphologically smooth binary image signals immersed in i.i.d....
Nikolaos Sidiropoulos, John S. Baras, Carlos Alber...
IJCAI
2001
14 years 10 months ago
Balance and Filtering in Structured Satisfiable Problems
New methods to generate hard random problem instances have driven progress on algorithms for deduction and constraint satisfaction. Recently Achlioptas et al. (AAAI 2000) introduc...
Henry A. Kautz, Yongshao Ruan, Dimitris Achlioptas...
AAAI
2004
14 years 11 months ago
Interactive Information Extraction with Constrained Conditional Random Fields
Information Extraction methods can be used to automatically "fill-in" database forms from unstructured data such as Web documents or email. State-of-the-art methods have...
Trausti T. Kristjansson, Aron Culotta, Paul A. Vio...
FC
2005
Springer
120views Cryptology» more  FC 2005»
15 years 3 months ago
Achieving Fairness in Private Contract Negotiation
Abstract. Suppose Alice and Bob are two entities (e.g. agents, organizations, etc.) that wish to negotiate a contract. A contract consists of several clauses, and each party has ce...
Keith B. Frikken, Mikhail J. Atallah
CORR
2004
Springer
115views Education» more  CORR 2004»
14 years 9 months ago
Jartege: a Tool for Random Generation of Unit Tests for Java Classes
This paper presents Jartege, a tool which allows random generation of unit tests for Java classes specified in JML. JML (Java Modeling Language) is a specification language for Ja...
Catherine Oriat