Sciweavers

1401 search results - page 131 / 281
» Randomness in Interactive Proofs
Sort
View
237
Voted

Source Code
846views
15 years 10 months ago
Supervised Color Image Segmentation in a Markovian Framework
This is the sample implementation of a Markov random field based color image segmentation algorithm described in the following paper: Zoltan Kato, Ting Chuen Pong, and John Chu...
Mihaly Gara, Zoltan Kato
114
Voted
EDM
2008
121views Data Mining» more  EDM 2008»
15 years 4 months ago
Analytic Comparison of Three Methods to Evaluate Tutorial Behaviors
We compare the purposes, inputs, representations, and assumptions of three methods to evaluate the fine-grained interactions of intelligent tutors with their students. One method i...
Jack Mostow, Xiaonan Zhang
133
Voted
ALIFE
2002
15 years 3 months ago
Evolvable Self-Replicating Molecules in an Artificial Chemistry
This paper gives details of Squirm3, a new artificial environment based on a simple physics and chemistry that supports self-replicating molecules somewhat similar to DNA. The sel...
Tim J. Hutton
136
Voted
CVPR
2009
IEEE
16 years 10 months ago
P-Brush: Continuous Valued MRFs with Normed Pairwise Distributions for Image Segmentation
Interactive image segmentation traditionally involves the use of algorithms such as Graph Cuts or Random Walker. Common concerns with using Graph Cuts are metrication artifacts ...
Dheeraj Singaraju, Leo Grady, René Vidal
TCC
2010
Springer
170views Cryptology» more  TCC 2010»
16 years 9 days ago
Public-Key Cryptographic Primitives Provably as Secure as Subset Sum
Abstract. We propose a semantically-secure public-key encryption scheme whose security is polynomialtime equivalent to the hardness of solving random instances of the subset sum pr...
Vadim Lyubashevsky, Adriana Palacio, Gil Segev