1554 search results - page 205 / 311 » Parameterized Complexity and Approximation Algorithms |
135
click to vote
STOC
2006
ACM
16 years 3 months ago
2006
ACM
Range searching is among the most fundamental problems in computational geometry. An n-element point set in Rd is given along with an assignment of weights to these points from so...
116
click to vote
ESA
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. Most recent papers addressing the algorithmic problem of allocating advertisement space for keywords in sponsored search auctions assume that pricing is done via a first...
121
click to vote
ECCV
2006
Springer
16 years 5 months ago
2006
Springer
Abstract. This article presents a novel method for acquiring high-quality solid models of complex 3D shapes from multiple calibrated photographs. After the purely geometric constra...
144
click to vote
ICC
2007
IEEE
15 years 9 months ago
2007
IEEE
Abstract—Most research on differential MIMO is based on spacetime block codes, aiming to achieve maximum transmit diversity and thus make the transmission more robust by the aid ...
104
click to vote
NIPS
2007
15 years 4 months ago
2007
Machine learning techniques are increasingly being used to produce a wide-range of classifiers for complex real-world applications that involve nonuniform testing costs and miscl...