1998 search results - page 324 / 400 » Complexity of the Cover Polynomial |
94
Voted
IPSN
2005
Springer
15 years 6 months ago
2005
Springer
Maximizing system lifetime in battery-powered wireless sensor networks with power aware topology control protocols and routing protocols has received intensive research. In the pa...
96
Voted
PKC
2005
Springer
15 years 6 months ago
2005
Springer
Coppersmith, Franklin, Patarin, and Reiter show that given two RSA cryptograms xe mod N and (ax + b)e mod N for known constants a, b ∈ ZN , one can compute x in O(e log2 e) ZN -o...
89
Voted
WABI
2005
Springer
15 years 6 months ago
2005
Springer
d Abstract] Tamir Tuller , Efrat Oron , Erez Makavy , Daniel A. Chamovitz † , and Benny Chor ‡ Tel-Aviv University, Tel-Aviv 69978, Israel. Abstract. We study gene expression d...
88
Voted
WINE
2005
Springer
15 years 6 months ago
2005
Springer
We study the complexity issues for Walrasian equilibrium in a special case of combinatorial auction, called single-minded auction, in which every participant is interested in only ...
103
click to vote
APWEB
2004
Springer
15 years 6 months ago
2004
Springer
Queries to data warehouses often involve hundreds of complex aggregations over large volumes of data, and so it is infeasible to compute these queries by scanning the data sources ...