840 search results - page 81 / 168 » The Complexity of the Extended GCD Problem |
119
click to vote
KI
2006
Springer
15 years 3 months ago
2006
Springer
Motivated by a chemical process engineering application, we introduce a new concept constructor in Description Logics (DLs), an n-ary variant of the existential restriction constr...
133
Voted
TOG
2008
15 years 3 months ago
2008
Shadow computation in dynamic scenes under complex illumination is a challenging problem. Methods based on precomputation provide accurate, real-time solutions, but are hard to ex...
140
Voted
AMAI
2004
Springer
15 years 3 months ago
2004
Springer
We introduce the notion of combinatorial vote, where a group of agents (or voters) is supposed to express preferences and come to a common decision concerning a set of non-independ...
108
Voted
IPL
2010
15 years 1 months ago
2010
We study the problem of learning parity functions that depend on at most k variables (kparities) attribute-efficiently in the mistake-bound model. We design a simple, deterministi...
169
Voted
TCS
2010
15 years 1 months ago
2010
The concept of stigmergy provides a simple framework for interaction and coordination in multi-agent systems. However, determining the global system behavior that will arise from ...