Sciweavers

6455 search results - page 442 / 1291
» Research problems
Sort
View
FOCS
2007
IEEE
16 years 1 months ago
Hardness of Reconstructing Multivariate Polynomials over Finite Fields
We study the polynomial reconstruction problem for low-degree multivariate polynomials over finite field F[2]. In this problem, we are given a set of points x ∈ {0, 1}n and ta...
Parikshit Gopalan, Subhash Khot, Rishi Saket
IPPS
2005
IEEE
16 years 13 days ago
Energy-Aware Task Scheduling: Towards Enabling Mobile Computing over MANETs
Enabling high performance, persistent mobile computing has recently become a very active research area. The widespread popularity of mobile computing devices, such as laptops, han...
Waleed Alsalih, Selim G. Akl, Hossam S. Hassanein
WISE
2005
Springer
16 years 12 days ago
Scalable Instance Retrieval for the Semantic Web by Approximation
Abstract. Approximation has been identified as a potential way of reducing the complexity of logical reasoning. Here we explore approximation for speeding up instance retrieval in...
Holger Wache, Perry Groot, Heiner Stuckenschmidt
RTAS
1999
IEEE
15 years 11 months ago
Timing Constraint Remapping to Avoid Time Discontinuities in Distributed Real-Time Systems
In this paper we propose a dynamic constraint transformation technique for ensuring timing requirements in a distributed real-time system possessing periodically synchronized dist...
Minsoo Ryu, Jungkeun Park, Seongsoo Hong
WDAG
1989
Springer
62views Algorithms» more  WDAG 1989»
15 years 11 months ago
Possibility and Impossibility Results in a Shared Memory Environment
We focus on unreliable asynchronous shared memory model which support only atomic read and write operations. For such a model we provide a necessary condition for the solvability ...
Gadi Taubenfeld, Shlomo Moran