Sciweavers

441 search results - page 27 / 89
» A Method for Proving Observational Equivalence
Sort
View
ICDM
2007
IEEE
136views Data Mining» more  ICDM 2007»
14 years 21 days ago
Data Discretization Unification
Data discretization is defined as a process of converting continuous data attribute values into a finite set of intervals with minimal loss of information. In this paper, we prove...
Ruoming Jin, Yuri Breitbart, Chibuike Muoh
APLAS
2006
ACM
14 years 2 months ago
Relational Reasoning for Recursive Types and References
We present a local relational reasoning method for reasoning about contextual equivalence of expressions in a λ-calculus with recursive types and general references. Our developme...
Nina Bohr, Lars Birkedal
TIP
2010
163views more  TIP 2010»
13 years 3 months ago
Fast Image Recovery Using Variable Splitting and Constrained Optimization
We propose a new fast algorithm for solving one of the standard formulations of image restoration and reconstruction which consists of an unconstrained optimization problem where t...
Manya V. Afonso, José M. Bioucas-Dias, M&aa...
ATAL
2009
Springer
14 years 3 months ago
Lossless clustering of histories in decentralized POMDPs
Decentralized partially observable Markov decision processes (Dec-POMDPs) constitute a generic and expressive framework for multiagent planning under uncertainty. However, plannin...
Frans A. Oliehoek, Shimon Whiteson, Matthijs T. J....
ICPR
2008
IEEE
14 years 3 months ago
Joint segmentation and registration of elastically deformable objects
We present a new approach to the general problem of template-based segmentation, detection, and registration. This joint problem is highly nonlinear and high dimensional, due to t...
Gilad Cohen, Joseph M. Francos, Rami Hagege