Sciweavers

3415 search results - page 660 / 683
» Lower Bounds for Kernelizations
Sort
View
STOC
1994
ACM
128views Algorithms» more  STOC 1994»
14 years 1 months ago
Weakly learning DNF and characterizing statistical query learning using Fourier analysis
We present new results on the well-studied problem of learning DNF expressions. We prove that an algorithm due to Kushilevitz and Mansour [13] can be used to weakly learn DNF form...
Avrim Blum, Merrick L. Furst, Jeffrey C. Jackson, ...
CASES
2007
ACM
14 years 1 months ago
Recursive function data allocation to scratch-pad memory
This paper presents the first automatic scheme to allocate local (stack) data in recursive functions to scratch-pad memory (SPM) in embedded systems. A scratch-pad is a fast direct...
Angel Dominguez, Nghi Nguyen, Rajeev Barua
SIGMOD
2010
ACM
196views Database» more  SIGMOD 2010»
14 years 1 months ago
Connected substructure similarity search
Substructure similarity search is to retrieve graphs that approximately contain a given query graph. It has many applications, e.g., detecting similar functions among chemical com...
Haichuan Shang, Xuemin Lin, Ying Zhang, Jeffrey Xu...
COCO
2010
Springer
153views Algorithms» more  COCO 2010»
14 years 1 months ago
Communication Complexity with Synchronized Clocks
Abstract—We consider two natural extensions of the communication complexity model that are inspired by distributed computing. In both models, two parties are equipped with synchr...
Russell Impagliazzo, Ryan Williams
DAC
2010
ACM
14 years 1 months ago
LUT-based FPGA technology mapping for reliability
As device size shrinks to the nanometer range, FPGAs are increasingly prone to manufacturing defects. We anticipate that the ability to tolerate multiple defects will be very impo...
Jason Cong, Kirill Minkovich