Sciweavers

8437 search results - page 417 / 1688
» Preferences over Sets
Sort
View
HCI
2011
14 years 10 months ago
How Children Can Design the Future
Over the past 15 years, children have become more integrally involved in the design of their technology. In this paper, we present the idea that design partnering methods, specific...
Mona Leigh Guha, Allison Druin, Jerry Alan Fails
IPL
2011
94views more  IPL 2011»
14 years 10 months ago
Lower bounds for context-free grammars
Ellul, Krawetz, Shallit and Wang prove an exponential lower bound on the size of any context-free grammar generating the language of all permutations over some alphabet. We genera...
Yuval Filmus
ICML
2005
IEEE
16 years 7 months ago
PAC-Bayes risk bounds for sample-compressed Gibbs classifiers
We extend the PAC-Bayes theorem to the sample-compression setting where each classifier is represented by two independent sources of information: a compression set which consists ...
François Laviolette, Mario Marchand
ASAP
2006
IEEE
111views Hardware» more  ASAP 2006»
16 years 27 days ago
Fast Bit Compression and Expansion with Parallel Extract and Parallel Deposit Instructions
Current microprocessor instruction set architectures are word oriented, with some subword support. Many important applications, however, can realize substantial performance benefi...
Yedidya Hilewitz, Ruby B. Lee
ISCC
2003
IEEE
135views Communications» more  ISCC 2003»
16 years 2 days ago
High Performance Routing in a LEO Satellite Network
Satellite systems are designed as a backup system to the existing land based wireless systems. Because of the global coverage of the system it becomes more economic for the rural ...
Roy Kucukates, Cem Ersoy