2996 search results - page 352 / 600 » Numberings and Randomness |
192
click to vote
EUROCRYPT
2009
Springer
16 years 7 months ago
2009
Springer
Almost any cryptographic scheme can be described by tweakable polynomials over GF(2), which contain both secret variables (e.g., key bits) and public variables (e.g., plaintext bit...
207
Voted
CVPR
2009
IEEE
17 years 1 months ago
2009
IEEE
The Conditional Random Fields (CRF) model, using
patch-based classification bound with context information,
has recently been widely adopted for image segmentation/
labeling. In...
209
click to vote
CVPR
2004
IEEE
16 years 8 months ago
2004
IEEE
Markov random field models provide a robust and unified framework for early vision problems such as stereo, optical flow and image restoration. Inference algorithms based on graph...
200
click to vote
ICML
2007
IEEE
16 years 7 months ago
2007
IEEE
We consider the problem of multi-task reinforcement learning, where the agent needs to solve a sequence of Markov Decision Processes (MDPs) chosen randomly from a fixed but unknow...
220
click to vote
VLSID
2004
IEEE
16 years 7 months ago
2004
IEEE
In this paper, we describe NoCGEN, a Network On Chip (NoC) generator, which is used to create a simulatable and synthesizable NoC description. NoCGEN uses a set of modularised rou...