2569 search results - page 376 / 514 » Approximate Objects and Approximate Theories |
205
Voted
FOCI
2007
IEEE
16 years 1 months ago
2007
IEEE
— A learning machine is called singular if its Fisher information matrix is singular. Almost all learning machines used in information processing are singular, for example, layer...
199
click to vote
GLOBECOM
2007
IEEE
16 years 1 months ago
2007
IEEE
—To understand how node mobility and Byzantine node failures affect connectivity of wireless multi-hop networks, this paper investigates resilience of geometric random graphs to ...
217
click to vote
ATAL
2007
Springer
16 years 1 months ago
2007
Springer
Planning in single-agent models like MDPs and POMDPs can be carried out by resorting to Q-value functions: a (near-) optimal Q-value function is computed in a recursive manner by ...
169
click to vote
SEMWEB
2007
Springer
16 years 1 months ago
2007
Springer
Abstract The most common matching applications, e.g., ontology matching, focus on the computation of the correspondences holding between the nodes of graph structures (e.g., concep...
189
click to vote
CIBCB
2006
IEEE
16 years 1 months ago
2006
IEEE
Abstract— Quantum mechanics and molecular dynamic simulation provide important insights into structural configurations and molecular interaction data today. To extend this atomi...