Sciweavers

8437 search results - page 177 / 1688
» Preferences over Sets
Sort
View
FOCS
2007
IEEE
16 years 23 days 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
LATA
2010
Springer
15 years 10 months ago
Variable Automata over Infinite Alphabets
Automated reasoning about systems with infinite domains requires an extension of regular automata to infinite alphabets. Existing formalisms of such automata cope with the infinite...
Sarai Sheinvald, Orna Grumberg, Orna Kupferman
JACM
2000
81views more  JACM 2000»
15 years 6 months ago
Relational queries over interpreted structures
We rework parts of the classical relational theory when the underlying domain is a structure with some interpreted operations that can be used in queries. We identify parts of the...
Michael Benedikt, Leonid Libkin
INFOCOM
2009
IEEE
16 years 1 months ago
On Combining Shortest-Path and Back-Pressure Routing Over Multihop Wireless Networks
Abstract—Back-pressure based algorithms based on the algorithm by Tassiulas and Ephremides have recently received much attention for jointly routing and scheduling over multihop ...
Lei Ying, Sanjay Shakkottai, Aneesh Reddy
JSAC
2006
180views more  JSAC 2006»
15 years 6 months ago
Adaptive spread-spectrum multicarrier multiple-access over wirelines
Abstract--In this paper, we investigate the dynamic resource allocation adapted to spread-spectrum multicarrier multiple-access (SS-MC-MA) systems in a multiuser power line communi...
Matthieu Crussière, Jean-Yves Baudais, Jean...