416 search results - page 69 / 84 » Approximation Algorithms for Reliable Stochastic Combinatori... |
SODA
2004
ACM
13 years 8 months ago
2004
ACM
The (axis-parallel) stabbing number of a given set of line segments is the maximum number of segments that can be intersected by any one (axis-parallel) line. We investigate probl...
ECCV
2010
Springer
13 years 11 months ago
2010
Springer
In this work we investigate an inverse geometry problem. Given a light source, a diffuse plane and a caustic image, how must a geometric object look like (transmissive or reflect...
INFOCOM
2010
IEEE
13 years 6 months ago
2010
IEEE
Abstract—We consider a cognitive radio network where multiple secondary users (SUs) contend for spectrum usage, using random access, over available primary user (PU) channels. Ou...
ICML
2006
IEEE
14 years 8 months ago
2006
IEEE
We study hierarchical classification in the general case when an instance could belong to more than one class node in the underlying taxonomy. Experiments done in previous work sh...
SAC
2006
ACM
13 years 7 months ago
2006
ACM
Many combinatorial optimization problems in biosequence analysis are solved via dynamic programming. To increase programming productivity and program reliability, a domain specifi...