4865 search results - page 577 / 973 » The Complexity of Graph Connectivity |
210
click to vote
ICML
2007
IEEE
16 years 7 months ago
2007
IEEE
A general framework is proposed for gradient boosting in supervised learning problems where the loss function is defined using a kernel over the output space. It extends boosting ...
204
click to vote
STOC
2006
ACM
16 years 7 months ago
2006
ACM
It is proved that several interactive proof systems are zero-knowledge against general quantum attacks. This includes the Goldreich?Micali?Wigderson classical zero-knowledge proto...
127
click to vote
ICCD
2000
IEEE
16 years 3 months ago
2000
IEEE
In this paper, we present a fast and eficient compilation methodology for pipeline reconfigurable architectures. Our compiler back-end is much faster than conventional CAD tools, ...
184
click to vote
ASAP
2007
IEEE
16 years 1 months ago
2007
IEEE
In this paper, we present and analyze a novel decoder architecture for LDPC convolutional codes (LDPCCCs). The proposed architecture enables high throughput and can be programmed ...
155
click to vote
ICASSP
2007
IEEE
16 years 1 months ago
2007
IEEE
We propose a multi-target tracking algorithm based on the Probability Hypothesis Density (PHD) filter and data association using graph matching. The PHD filter is used to compen...