2766 search results - page 436 / 554 » Algorithms for trigonometric polynomials |
127
click to vote
INFOCOM
2010
IEEE
15 years 2 months ago
2010
IEEE
We study the problem of finding the least-priced path (LPP) between a source and a destination in opportunistic spectrum access (OSA) networks. This problem is motivated by econo...
122
click to vote
KAIS
2010
15 years 2 months ago
2010
In systems of interacting entities such as social networks, interactions that occur regularly typically correspond to significant, yet often infrequent and hard to detect, interact...
127
click to vote
MST
2010
15 years 2 months ago
2010
We study the following variant of the bin covering problem. We are given a set of unit sized items, where each item has a color associated with it. We are given an integer paramet...
135
Voted
PVLDB
2010
15 years 2 months ago
2010
Ranking is a fundamental operation in data analysis and decision support, and plays an even more crucial role if the dataset being explored exhibits uncertainty. This has led to m...
105
Voted
SODA
2010
ACM
15 years 2 months ago
2010
ACM
We consider computational aspects of alternating move games, repeated games in which players take actions at alternating time steps rather than playing simultaneously. We show tha...