Sciweavers

13603 search results - page 225 / 2721
» On the Computational Complexity of Cut-Reduction
Sort
View
IADIS
2004
15 years 8 months ago
Computation and Construction Kits: Toward the Next Generation of Tangible Building Media for Children
Construction kits represent a venerable, creative, and (occasionally) even beautiful genre of educational toys for children. Nonetheless, traditional construction kits have limita...
Michael Eisenberg, Leah Buechley, Nwanua Elumeze
ALGORITHMICA
2010
159views more  ALGORITHMICA 2010»
15 years 6 months ago
Computing the Greedy Spanner in Near-Quadratic Time
It is well-known that the greedy algorithm produces high quality spanners and therefore is used in several applications. However, for points in d-dimensional Euclidean space, the g...
Prosenjit Bose, Paz Carmi, Mohammad Farshi, Anil M...
CG
2006
Springer
15 years 6 months ago
Computational methods for understanding 3D shapes
Understanding shapes has been a challenging issue for many years, firstly motivated by computer vision and more recently by many complex applications in diverse fields, such as me...
Marco Attene, Silvia Biasotti, Michela Mortara, Gi...
CSJM
2006
81views more  CSJM 2006»
15 years 6 months ago
Nash equilibria set computing in finite extended games
The Nash equilibria set (NES) is described as an intersection of graphs of best response mappings. The problem of NES computing for multi-matrix extended games is considered. A me...
Valeriu Ungureanu
CSDA
2007
109views more  CSDA 2007»
15 years 6 months ago
Improving the computation of censored quantile regressions
Abstract. Censored quantile regressions (CQR) are a valuable tool in economics and engineering. The computation of estimators is highly complex and the performance of standard meth...
Bernd Fitzenberger, Peter Winker