1208 search results - page 76 / 242 » Uniform eventown problems |
83
Voted
ICALP
1990
Springer
15 years 2 months ago
1990
Springer
We show how (now familiar) hierarchical representations of (convex) polyhedra can be used to answer various separation queries efficiently (in a number of cases, optimally). Our e...
91
Voted
SODA
2008
ACM
14 years 11 months ago
2008
ACM
We consider graph coloring problems where the cost of a coloring is the sum of the costs of the colors, and the cost of a color is a monotone concave function of the total weight ...
WICON
2008
14 years 11 months ago
2008
We consider the problem of efficient opportunistic spectrum access in cognitive radio networks where there are multiple secondary users trying to share access to multiple channels...
IJCGA
2002
14 years 10 months ago
2002
Given a set P of n points in the plane, the two-circle point-labeling problem consists of placing 2n uniform, non-intersecting, maximum-size open circles such that each point touc...
ICASSP
2010
IEEE
14 years 8 months ago
2010
IEEE
In many signal processing problems, it may be fruitful to represent the signal under study in a redundant linear decomposition called a frame. If a probabilistic approach is adopt...