Sciweavers

1006 search results - page 51 / 202
» What is this page known for
Sort
View
SWAT
2004
Springer
108views Algorithms» more  SWAT 2004»
14 years 2 months ago
Pointed Binary Encompassing Trees
For n disjoint line segments in the plane we can construct a binary encompassing tree such that every vertex is pointed, what’s more, at every segment endpoint all incident edges...
Michael Hoffmann, Bettina Speckmann, Csaba D. T&oa...
PERSUASIVE
2010
Springer
14 years 1 months ago
Design Dimensions Enabling Divergent Behaviour across Physical, Digital, and Social Library Interfaces
What design dimensions across physical, digital, and social library interfaces may enable and trigger users to find more information resources than planned or known in advance? The...
Lennart Björneborn
MICAI
2009
Springer
14 years 1 months ago
Planning for Conditional Learning Routes
Abstract. This paper builds on a previous work in which an HTN planner is used to obtain learning routes expressed in the standard language IMS-LD and its main contribution is the ...
Lluvia Morales, Luis A. Castillo, Juan Ferná...
ACCV
1998
Springer
14 years 1 months ago
Minimal Conditions on Intrinsic Parameters for Euclidean Reconstruction
Abstract In this paper will be investigated what constraints on the intrinsic parameters that are needed in order to reconstruct an unknown scene from a number of its projective im...
Anders Heyden, Kalle Åström
AC
1997
Springer
14 years 1 months ago
Cryptographic Primitives for Information Authentication - State of the Art
This paper describes the state of the art for cryptographic primitives that are used for protecting the authenticity of information: cryptographic hash functions and digital signat...
Bart Preneel