Sciweavers

167 search results - page 22 / 34
» A New Lower Bound for A(17, 6, 6)
Sort
View
NIPS
2008
13 years 9 months ago
Privacy-preserving logistic regression
This paper addresses the important tradeoff between privacy and learnability, when designing algorithms for learning from private databases. We focus on privacy-preserving logisti...
Kamalika Chaudhuri, Claire Monteleoni
GECCO
2005
Springer
104views Optimization» more  GECCO 2005»
14 years 1 months ago
MOEA design of robust digital symbol sets
Optimal constellation design is important in military digital communications for Quadrature Amplitude Modulation (QAM). Optimization realizes a reduced probability of bit error (P...
Richard O. Day, Abel S. Nunez, Gary B. Lamont
GLVLSI
2002
IEEE
109views VLSI» more  GLVLSI 2002»
14 years 28 days ago
Minimizing resources in a repeating schedule for a split-node data-flow graph
Many computation-intensive or recursive applications commonly found in digital signal processing and image processing applications can be represented by data-flow graphs (DFGs). ...
Timothy W. O'Neil, Edwin Hsing-Mean Sha
ACL
1990
13 years 9 months ago
An Efficient Parsing Algorithm for Tree Adjoining Grammars
In the literature, Tree Adjoining Grammars (TAGs) are propagated to be adequate for natural language description -- analysis as well as generation. In this paper we concentrate on...
Karin Harbusch
DAM
2007
70views more  DAM 2007»
13 years 8 months ago
Path-kipas Ramsey numbers
For two given graphs F and H, the Ramsey number R(F, H) is the smallest positive integer p such that for every graph G on p vertices the following holds: either G contains F as a ...
A. N. M. Salman, H. J. Broersma