Sciweavers

3937 search results - page 319 / 788
» Questioning Ubiquitous Computing
Sort
View
SCALESPACE
2005
Springer
16 years 4 days ago
On Similarity-Invariant Fairness Measures
Abstract. After introducing the basic principles behind the similarityinvariant smoothness measures for curves and surfaces, with references to the relevant literature, we discuss ...
Alexander Brook, Alfred M. Bruckstein, Ron Kimmel
ESA
2001
Springer
104views Algorithms» more  ESA 2001»
15 years 11 months ago
Smallest Color-Spanning Objects
Motivated by questions in location planning, we show for a set of colored point sites in the plane how to compute the smallest— by perimeter or area—axis-parallel rectangle and...
Manuel Abellanas, Ferran Hurtado, Christian Icking...
152
Voted
CADE
1992
Springer
15 years 10 months ago
Polynomial Interpretations and the Complexity of Algorithms
The ability to use a polynomial iterpretation to prove termination of a rewrite system naturally prompts the question as to what restriction on complexity this imposes. The main r...
Adam Cichon, Pierre Lescanne
117
Voted
ANTS
2008
Springer
57views Algorithms» more  ANTS 2008»
15 years 8 months ago
Functorial Properties of Stark Units in Multiquadratic Extensions
Abstract. The goal of this paper is to present computations investigating the "functorial" properties of Stark units, that is, how specific roots of Stark units from cert...
Jonathan W. Sands, Brett A. Tangedal
IJCAI
1993
15 years 8 months ago
Artificial Thought and Emergent Mind
We consider the question of whether or not a successful attempt to simulate human (rational) thought on a computer can contribute to our understanding of the mind, including perha...
Ivan M. Havel