Sciweavers

664 search results - page 67 / 133
» Some results for a class of generalized polynomials
Sort
View
ANOR
2005
56views more  ANOR 2005»
14 years 9 months ago
Two-Machine Flowshop Batching and Scheduling
: We consider in this paper a two-machine flowshop scheduling problem in which the first machine processes jobs individually while the second machine processes jobs in batches. The...
Bertrand M. T. Lin, T. C. Edwin Cheng
FOCS
2005
IEEE
15 years 3 months ago
Learning mixtures of product distributions over discrete domains
We consider the problem of learning mixtures of product distributions over discrete domains in the distribution learning framework introduced by Kearns et al. [18]. We give a poly...
Jon Feldman, Ryan O'Donnell, Rocco A. Servedio
CHI
2002
ACM
15 years 10 months ago
The philosophy and design of socially adept technologies
Context-aware artifacts can be seen as an important class of socially adept technologies. In this paper, we focus on the fact that disregarding trivial notions of context, context...
Stephen Marsh, Lucy T. Nowell, John F. Meech, Kers...
ISAAC
2005
Springer
112views Algorithms» more  ISAAC 2005»
15 years 3 months ago
Hybrid Voting Protocols and Hardness of Manipulation
This paper addresses the problem of constructing voting protocols that are hard to manipulate. We describe a general technique for obtaining a new protocol by combining two or more...
Edith Elkind, Helger Lipmaa
COMBINATORICS
2002
70views more  COMBINATORICS 2002»
14 years 9 months ago
Set-Systems with Restricted Multiple Intersections
We give a generalization for the Deza-Frankl-Singhi Theorem in case of multiple intersections. More exactly, we prove, that if H is a set-system, which satisfies that for some k, ...
Vince Grolmusz