Sciweavers

2496 search results - page 179 / 500
» On covering by translates of a set
Sort
View
CSL
2006
Springer
15 years 10 months ago
Decidable Theories of the Ordering of Natural Numbers with Unary Predicates
Abstract. Expansions of the natural number ordering by unary predicates are studied, using logics which in expressive power are located between first-order and monadic second-order...
Alexander Moshe Rabinovich, Wolfgang Thomas
CIE
2008
Springer
15 years 8 months ago
Perfect Local Computability and Computable Simulations
We study perfectly locally computable structures, which are (possibly uncountable) structures S that have highly effective presentations of their local properties. We show that eve...
Russell Miller, Dustin Mulcahey
SODA
2004
ACM
80views Algorithms» more  SODA 2004»
15 years 8 months ago
Output-sensitive construction of the union of triangles
We present an efficient algorithm for the following problem: Given a collection T = {1, . . . , n} of n triangles in the plane, such that there exists a subset S T (unknown to us)...
Eti Ezra, Micha Sharir
DLOG
2009
15 years 7 months ago
Which Kind of Module Should I Extract?
Abstract There are various techniques for specifying a module of an ontology that covers all knowledge about a given set of terms. These differ with respect to the size of the modu...
Ulrike Sattler, Thomas Schneider 0002, Michael Zak...
CORR
2008
Springer
172views Education» more  CORR 2008»
15 years 6 months ago
Lecture notes on the lambda calculus
This is a set of lecture notes that developed out of courses on the lambda calculus that I taught at the University of Ottawa in 2001 and at Dalhousie University in 2007. Topics c...
Peter Selinger