Sciweavers

9842 search results - page 1513 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
DATE
2004
IEEE
119views Hardware» more  DATE 2004»
15 years 10 months ago
MINCE: Matching INstructions Using Combinational Equivalence for Extensible Processor
Designing custom-extensible instructions for Extensible Processors1 is a computationally complex task because of the large design space. The task of automatically matching candida...
Newton Cheung, Sri Parameswaran, Jörg Henkel,...
CASC
2006
Springer
128views Mathematics» more  CASC 2006»
15 years 10 months ago
New Domains for Applied Quantifier Elimination
We address various aspects of our computer algebra-based computer logic system redlog. There are numerous examples in the literature for successful applications of redlog to practi...
Thomas Sturm
CEAS
2006
Springer
15 years 10 months ago
Fast Uncertainty Sampling for Labeling Large E-mail Corpora
One of the biggest challenges in building effective anti-spam solutions is designing systems to defend against the everevolving bag of tricks spammers use to defeat them. Because ...
Richard Segal, Ted Markowitz, William Arnold
COLT
2006
Springer
15 years 10 months ago
Efficient Learning Algorithms Yield Circuit Lower Bounds
We describe a new approach for understanding the difficulty of designing efficient learning algorithms. We prove that the existence of an efficient learning algorithm for a circui...
Lance Fortnow, Adam R. Klivans
ECTEL
2006
Springer
15 years 10 months ago
Getting to Know Your Student in Distance Learning Contexts
Abstract. Good teachers know their students, and exploit this knowledge to adapt or optimise their instruction. Teachers know their students because they interact with them face-to...
Claus Zinn, Oliver Scheuer
« Prev « First page 1513 / 1969 Last » Next »