2638 search results - page 136 / 528 » Random Geometric Complexes |
119
click to vote
AAAI
1998
15 years 6 months ago
1998
Dynamically providing students with clear explanations of complex spatial concepts is critical for a broad range of knowledge-based educational and training systems. This calls fo...
135
click to vote
FOCS
2007
IEEE
15 years 11 months ago
2007
IEEE
In this paper, we resolve the smoothed and approximative complexity of low-rank quasi-concave minimization, providing both upper and lower bounds. As an upper bound, we provide th...
149
click to vote
ACMICEC
2003
ACM
15 years 10 months ago
2003
ACM
The aggregation of conflicting preferences is a central problem in multiagent systems. The key difficulty is that the agents may report their preferences insincerely. Mechanism ...
158
click to vote
IPPS
1999
IEEE
15 years 9 months ago
1999
IEEE
Block-wise access to data is a central theme in the design of efficient external memory (EM) algorithms. A second important issue, when more than one disk is present, is fully par...
134
Voted
CSCWD
2009
Springer
15 years 11 months ago
2009
Springer
Constrained random simulation methodology still plays an important role in hardware verification due to the limited scalability of formal verification, especially for the large an...