Sciweavers

2996 search results - page 300 / 600
» Numberings and Randomness
Sort
View
SIGECOM
2008
ACM
138views ECommerce» more  SIGECOM 2008»
15 years 6 months ago
Generalized scoring rules and the frequency of coalitional manipulability
We introduce a class of voting rules called generalized scoring rules. Under such a rule, each vote generates a vector of k scores, and the outcome of the voting rule is based onl...
Lirong Xia, Vincent Conitzer
ICASSP
2008
IEEE
16 years 1 months ago
Compressive sensing of parameterized shapes in images
Compressive Sensing (CS) uses a relatively small number of non-traditional samples in the form of randomized projections to reconstruct sparse or compressible signals. The Hough t...
Ali Cafer Gurbuz, James H. McClellan, Justin K. Ro...
CODES
2004
IEEE
15 years 10 months ago
Automatic synthesis of system on chip multiprocessor architectures for process networks
In this paper, we present an approach for automatic synthesis of System on Chip (SoC) multiprocessor architectures for applications expressed as process networks. Our approach is ...
Basant Kumar Dwivedi, Anshul Kumar, M. Balakrishna...
COMBINATORICS
2006
129views more  COMBINATORICS 2006»
15 years 6 months ago
Descendants in Increasing Trees
Simple families of increasing trees can be constructed from simply generated tree families, if one considers for every tree of size n all its increasing labellings, i. e. labellin...
Markus Kuba, Alois Panholzer
UAI
2004
15 years 8 months ago
PAC-learning Bounded Tree-width Graphical Models
We show that the class of strongly connected graphical models with treewidth at most k can be properly efficiently PAC-learnt with respect to the Kullback-Leibler Divergence. Prev...
Mukund Narasimhan, Jeff A. Bilmes