Sciweavers

575 search results - page 30 / 115
» constraints 2011
Sort
View
SAT
2011
Springer
263views Hardware» more  SAT 2011»
14 years 2 months ago
Failed Literal Detection for QBF
Failed literal detection (FL) in SAT is a powerful approach for preprocessing. The basic idea is to assign a variable as assumption. If boolean constraint propagation (BCP) yields ...
Florian Lonsing, Armin Biere
DAWAK
2011
Springer
13 years 11 months ago
Support for User Involvement in Data Cleaning
Data cleaning and ETL processes are usually modeled as graphs of data transformations. The involvement of the users responsible for executing these graphs over real data is importa...
Helena Galhardas, Antónia Lopes, Emanuel Sa...
FPL
2011
Springer
168views Hardware» more  FPL 2011»
13 years 11 months ago
Scalable Arbiters and Multiplexers for On-FGPA Interconnection Networks
Abstract—Soft on-FGPA interconnection networks are gaining increasing importance since they simplify the integration of heterogeneous components and offer, at the same time, a mo...
Giorgos Dimitrakopoulos, Christoforos Kachris, Emm...
ICDAR
2011
IEEE
13 years 11 months ago
A Digital Ink Recogntion Server for Handwritten Japanese Text
— This paper describes the design and implementation of a digital ink recognition server for handwritten Japanese text. Currently, fast and accurate recognition of online handwri...
Daqing Wang, Bilan Zhu, Masaki Nakagawa
89
Voted
ACL
2011
14 years 3 months ago
In-domain Relation Discovery with Meta-constraints via Posterior Regularization
We present a novel approach to discovering relations and their instantiations from a collection of documents in a single domain. Our approach learns relation types by exploiting m...
Harr Chen, Edward Benson, Tahira Naseem, Regina Ba...