Sciweavers

358 search results - page 14 / 72
» Ten More Unsolved Problems in Computer Graphics
Sort
View
ICCS
2005
Springer
14 years 1 months ago
The Dynamics of Computing Agent Systems
The paper presents the Multi Agent System (MAS) designed for the large scale parallel computations. The special kind of diffusionbased scheduling enables to decompose and allocate...
Maciej Smolka, Piotr Uhruski, Robert Schaefer, Mar...
STOC
2004
ACM
121views Algorithms» more  STOC 2004»
14 years 8 months ago
Lower bounds for dynamic connectivity
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
Mihai Patrascu, Erik D. Demaine
JMLR
2006
125views more  JMLR 2006»
13 years 8 months ago
Linear Programming Relaxations and Belief Propagation - An Empirical Study
The problem of finding the most probable (MAP) configuration in graphical models comes up in a wide range of applications. In a general graphical model this problem is NP hard, bu...
Chen Yanover, Talya Meltzer, Yair Weiss
ISI
2005
Springer
14 years 1 months ago
An Ontological Approach to the Document Access Problem of Insider Threat
Verification of legitimate access of documents, which is one aspect of the umbrella of problems in the Insider Threat category, is a challenging problem. This paper describes the r...
Boanerges Aleman-Meza, Phillip Burns, Matthew Eave...
RT
2005
Springer
14 years 1 months ago
Importance Resampling for Global Illumination
This paper develops importance resampling into a variance reduction technique for Monte Carlo integration. Importance resampling is a sample generation technique that can be used ...
Justin Talbot, David Cline, Parris K. Egbert