Sciweavers

19320 search results - page 320 / 3864
» On the complexity of computing determinants
Sort
View
158
Voted
ACII
2005
Springer
16 years 8 days ago
Generalization of a Vision-Based Computational Model of Mind-Reading
This paper describes a vision-based computational model of mind-reading that infers complex mental states from head and facial expressions in real-time. The generalization ability ...
Rana El Kaliouby, Peter Robinson
CRYPTO
2005
Springer
135views Cryptology» more  CRYPTO 2005»
16 years 8 days ago
Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator
We present a constant-round protocol for general secure multiparty computation which makes a black-box use of a pseudorandom generator. In particular, the protocol does not requir...
Ivan Damgård, Yuval Ishai
TCS
2008
15 years 6 months ago
Fine hierarchies and m-reducibilities in theoretical computer science
This is a survey of results about versions of fine hierarchies and many-one reducibilities that appear in different parts of theoretical computer science. These notions and relate...
Victor L. Selivanov
FOCS
2006
IEEE
16 years 24 days ago
Heat Flow and a Faster Algorithm to Compute the Surface Area of a Convex Body
We draw on the observation that the amount of heat diffusing outside of a heated body in a short period of time is proportional to its surface area, to design a simple algorithm f...
Mikhail Belkin, Hariharan Narayanan, Partha Niyogi
190
Voted
IPPS
2003
IEEE
16 years 8 hour ago
A Genetic Approach to Planning in Heterogeneous Computing Environments
Planning is an artificial intelligence problem with a wide range of real-world applications. Genetic algorithms, neural networks, and simulated annealing are heuristic search met...
Han Yu, Dan C. Marinescu, Annie S. Wu, Howard Jay ...