Sciweavers

373 search results - page 10 / 75
» Abstract Geometrical Computation for Black Hole Computation
Sort
View
COMPUTING
1999
99views more  COMPUTING 1999»
13 years 7 months ago
A Minimal Line Property Preserving Representation of Line Images
In line image understandingaminimal lineproperty preserving(MLPP)graphoftheimagecompliments the structural information in geometric graph representations like the run graph. With ...
Mark Burge, Walter G. Kropatsch
IPSN
2005
Springer
14 years 26 days ago
Coverage and hole-detection in sensor networks via homology
We consider coverage problems in sensor networks of stationary nodes with minimal geometric data. In particular, there are no coordinates and no localization of nodes. We introduc...
Robert Ghrist, Abubakr Muhammad
SYNASC
2008
IEEE
284views Algorithms» more  SYNASC 2008»
14 years 1 months ago
Graph Rewriting in Computational Origami
We formalize paper fold (origami) by graph rewriting. Origami tion is abstractly described by a rewrite system (O, ), where set of abstract origami’s and is a binary relation on ...
Tetsuo Ida
VL
1998
IEEE
134views Visual Languages» more  VL 1998»
13 years 11 months ago
Visual Semantics - Or: What You See is What You Compute
We introduce visual graphs as an intermediate repren between concrete visual syntax and abstract graph syntax. In a visual graph some nodes are shown as geometric figures, and som...
Martin Erwig
CRYPTO
1995
Springer
135views Cryptology» more  CRYPTO 1995»
13 years 11 months ago
Committed Oblivious Transfer and Private Multi-Party Computation
Abstract. In this paper we present an eficient protocol for “Committed Oblivious Transfer” to perform oblivious transfer on committed bits: suppose Alice is committed to bits 0...
Claude Crépeau, Jeroen van de Graaf, Alain ...