3874 search results - page 478 / 775 » Approximation Algorithms for k-hurdle Problems |
152
click to vote
COLT
2007
Springer
16 years 24 days ago
2007
Springer
Abstract. We consider the problem of learning an acyclic discrete circuit with n wires, fan-in bounded by k and alphabet size s using value injection queries. For the class of tran...
200
click to vote
ICML
1999
IEEE
16 years 7 months ago
1999
IEEE
Excerpted from: Boyan, Justin. Learning Evaluation Functions for Global Optimization. Ph.D. thesis, Carnegie Mellon University, August 1998. (Available as Technical Report CMU-CS-...
161
click to vote
SWAT
2004
Springer
15 years 12 months ago
2004
Springer
Let A and B be two sets of n resp. m disjoint unit disks in the plane, with m ≥ n. We consider the problem of finding a translation or rigid motion of A that maximizes the tota...
208
click to vote
INFOCOM
2007
IEEE
16 years 27 days ago
2007
IEEE
— This paper studies the tradeoff between energy consumption and application performance in wireless sensor networks by investigating the interaction between network lifetime max...
185
click to vote
MST
2006
15 years 6 months ago
2006
A central question in computational biology is the design of genetic markers to distinguish between two given sets of (DNA) sequences. This question is formalized as the NP-comple...