Sciweavers

16666 search results - page 352 / 3334
» Descriptive and Computational Complexity
Sort
View
CRYPTO
2005
Springer
135views Cryptology» more  CRYPTO 2005»
16 years 9 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 25 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
191
Voted
IPPS
2003
IEEE
16 years 1 days 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 ...
INTERACT
2007
15 years 8 months ago
Interacting with the Computer Using Gaze Gestures
This paper investigates novel ways to direct computers by eye gaze. Instead of using fixations and dwell times, this work focuses on eye motion, in particular gaze gestures. Gaze g...
Heiko Drewes, Albrecht Schmidt