Sciweavers

13603 search results - page 419 / 2721
» On the Complexity of Computing Treelength
Sort
View
156
Voted
CG
2006
Springer
15 years 7 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...
209
Voted
CSJM
2006
81views more  CSJM 2006»
15 years 7 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
161
Voted
CSDA
2007
109views more  CSDA 2007»
15 years 7 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
167
Voted
PERCOM
2008
ACM
16 years 7 months ago
A Context Query Language for Pervasive Computing Environments
This paper identifies requirements for querying and accessing context information in mobile and pervasive computing environments. Furthermore it studies existing query languages s...
Roland Reichle, Michael Wagner, Mohammad Ullah Kha...
195
Voted
TACAS
2009
Springer
134views Algorithms» more  TACAS 2009»
16 years 2 months ago
Computing Weakest Strategies for Safety Games of Imperfect Information
CEDAR (Counter Example Driven Antichain Refinement) is a new symbolic algorithm for computing weakest strategies for safety games of imperfect information. The algorithm computes ...
Wouter Kuijper, Jaco van de Pol