Sciweavers

2766 search results - page 226 / 554
» Algorithms for trigonometric polynomials
Sort
View
EUROGRAPHICS
2010
Eurographics
16 years 9 days ago
Interactive High-Quality Visualization of Higher-Order Finite Elements
Higher-order finite element methods have emerged as an important discretization scheme for simulation. They are increasingly used in contemporary numerical solvers, generating a ...
Markus Üffinger, Steffen Frey, Thomas Ertl
145
Voted
ECCC
2006
145views more  ECCC 2006»
15 years 5 months ago
Constraint satisfaction: a personal perspective
Attempts at classifying computational problems as polynomial time solvable, NP-complete, or belonging to a higher level in the polynomial hierarchy, face the difficulty of undecid...
Tomás Feder
141
Voted
SIGECOM
2006
ACM
119views ECommerce» more  SIGECOM 2006»
15 years 11 months ago
Nash equilibria in graphical games on trees revisited
Graphical games have been proposed as a game-theoretic model of large-scale distributed networks of non-cooperative agents. When the number of players is large, and the underlying...
Edith Elkind, Leslie Ann Goldberg, Paul W. Goldber...
CSFW
2008
IEEE
15 years 11 months ago
A Type System for Observational Determinism
Zdancewic and Myers introduced observational determinism as a scheduler independent notion of security for concurrent programs. This paper proposes a type system for verifying obs...
Tachio Terauchi
KI
2007
Springer
15 years 11 months ago
Pinpointing in the Description Logic EL+
Axiom pinpointing has been introduced in description logics (DLs) to help the user understand the reasons why consequences hold by computing minimal subsets of the knowledge base t...
Franz Baader, Rafael Peñaloza, Boontawee Su...