Sciweavers

95 search results - page 13 / 19
» Recursive Structures for Standard ML
Sort
View
ADC
2006
Springer
119views Database» more  ADC 2006»
13 years 11 months ago
Using reflection for querying XML documents
XML-based databases have become a major area of in database research. Abstractly speaking they can be considered as a resurrection of complexvalue databases using constructors for...
Markus Kirchberg, Faizal Riaz-ud-Din, Klaus-Dieter...
ICFP
2000
ACM
13 years 11 months ago
Intersection types and computational effects
We show that standard formulations of intersection type systems are unsound in the presence of computational effects, and propose a solution similar to the value restriction for ...
Rowan Davies, Frank Pfenning
JOC
2000
95views more  JOC 2000»
13 years 7 months ago
Player Simulation and General Adversary Structures in Perfect Multiparty Computation
The goal of secure multiparty computation is to transform a given protocol involving a trusted party into a protocol without need for the trusted party, by simulating the party am...
Martin Hirt, Ueli M. Maurer
IROS
2009
IEEE
214views Robotics» more  IROS 2009»
14 years 2 months ago
1-point RANSAC for EKF-based Structure from Motion
Abstract— Recently, classical pairwise Structure From Motion (SfM) techniques have been combined with non-linear global optimization (Bundle Adjustment, BA) over a sliding window...
Javier Civera, Oscar G. Grasa, Andrew J. Davison, ...
AAECC
2006
Springer
122views Algorithms» more  AAECC 2006»
13 years 11 months ago
Low-Floor Tanner Codes Via Hamming-Node or RSCC-Node Doping
We study the design of structured Tanner codes with low error-rate floors on the AWGN channel. The design technique involves the "doping" of standard LDPC (proto-)graphs,...
Shadi Abu-Surra, Gianluigi Liva, William E. Ryan