1802 search results - page 180 / 361 » Complexity Theory for Operators in Analysis |
194
click to vote
ISSAC
2009
Springer
16 years 1 months ago
2009
Springer
Cylindrical algebraic decomposition is one of the most important tools for computing with semi-algebraic sets, while triangular decomposition is among the most important approache...
150
click to vote
COMPGEOM
2009
ACM
16 years 1 months ago
2009
ACM
It was shown in [11] that any orientable graph of genus g can be probabilistically embedded into a graph of genus g − 1 with constant distortion. Removing handles one by one giv...
188
click to vote
AGTIVE
2007
Springer
16 years 20 days ago
2007
Springer
In collaborative ontology engineering, contexts are key to manage the complexity of different dependency types between ontological artefacts. Instead of being frustrated by out-of...
143
click to vote
MSR
2006
ACM
16 years 13 days ago
2006
ACM
Software may contain functionality that does not align with its architecture. Such cross-cutting concerns do not exist from the beginning but emerge over time. By analysing where ...
183
click to vote
SIGECOM
2006
ACM
16 years 12 days ago
2006
ACM
We present a reduction from graphical games to Markov random fields so that pure Nash equilibria in the former can be found by statistical inference on the latter. Our result, wh...