Sciweavers

567 search results - page 62 / 114
» Decomposing replicable functions
Sort
View
TCAD
2008
112views more  TCAD 2008»
15 years 20 days ago
Exploiting Symmetries to Speed Up SAT-Based Boolean Matching for Logic Synthesis of FPGAs
Boolean matching is one of the enabling techniques for technology mapping and logic resynthesis of Field Programmable Gate Array (FPGA). SAT-based Boolean matching (SAT-BM) has bee...
Yu Hu, Victor Shih, Rupak Majumdar, Lei He
89
Voted
IS
2007
15 years 19 days ago
The leganet system: Freshness-aware transaction routing in a database cluster
We consider the use of a database cluster for Application Service Provider (ASP). In the ASP context, applications and databases can be update-intensive and must remain autonomous....
Stéphane Gançarski, Hubert Naacke, E...
IEE
2000
143views more  IEE 2000»
15 years 17 days ago
Object-oriented preprocessor fit for C++
: C++ retains the ANSI C preprocessor, although its limitations have been widely recognised. We describe FOG, a meta-compiler for a super-set of C++, that provides replacement prep...
Edward D. Willink, Vyacheslav B. Muchnick
102
Voted
ITS
2010
Springer
147views Multimedia» more  ITS 2010»
14 years 10 months ago
Showing the Positive Influence of Subliminal Cues on Learner's Performance and Intuition: An ERP Study
This paper presents results from an empirical study conducted with a novel subliminal teaching technique aimed at enhancing learners performance in an ITS. We replicated previous f...
Pierre Chalfoun, Claude Frasson
ICML
2004
IEEE
16 years 1 months ago
Leveraging the margin more carefully
Boosting is a popular approach for building accurate classifiers. Despite the initial popular belief, boosting algorithms do exhibit overfitting and are sensitive to label noise. ...
Nir Krause, Yoram Singer