Sciweavers

738 search results - page 72 / 148
» Prime Implicant Computation Using Satisfiability Algorithms
Sort
View
MST
2002
128views more  MST 2002»
14 years 9 months ago
A Simple and Efficient Parallel Disk Mergesort
External sorting--the process of sorting a file that is too large to fit into the computer's internal memory and must be stored externally on disks--is a fundamental subroutin...
Rakesh D. Barve, Jeffrey Scott Vitter
STOC
2003
ACM
154views Algorithms» more  STOC 2003»
15 years 10 months ago
Boosting in the presence of noise
Boosting algorithms are procedures that "boost" low-accuracy weak learning algorithms to achieve arbitrarily high accuracy. Over the past decade boosting has been widely...
Adam Kalai, Rocco A. Servedio
STOC
2012
ACM
192views Algorithms» more  STOC 2012»
13 years 7 days ago
Nearly optimal sparse fourier transform
We consider the problem of computing the k-sparse approximation to the discrete Fourier transform of an ndimensional signal. We show: • An O(k log n)-time randomized algorithm f...
Haitham Hassanieh, Piotr Indyk, Dina Katabi, Eric ...
ATAL
2003
Springer
15 years 3 months ago
Robust software via agent-based redundancy
This paper describes how multiagent systems can be used to achieve robust software, one of the major goals of software engineering. The paper first positions itself within the sof...
Michael N. Huhns, Vance T. Holderfield, Rosa Laura...
IUI
2003
ACM
15 years 3 months ago
A model of textual affect sensing using real-world knowledge
This paper presents a novel way for assessing the affective qualities of natural language and a scenario for its use. Previous approaches to textual affect sensing have employed k...
Hugo Liu, Henry Lieberman, Ted Selker