796 search results - page 108 / 160 » Approximating the centroid is hard |
ESA
2009
Springer
14 years 9 days ago
2009
Springer
Sponsored search auctions provide a marketplace where advertisers can bid for millions of advertising opportunities to promote their products. The main difficulty facing the adver...
COCO
2001
Springer
14 years 5 days ago
2001
Springer
Motivated by recent work on quantum black-box query complexity, we consider quantum versions of two wellstudied models of learning Boolean functions: Angluin’s model of exact le...
VISUALIZATION
1998
IEEE
13 years 12 months ago
1998
IEEE
Real-time rendering of triangulated surfaces has attracted growing interest in the last few years. However, interactive visualization of very large scale grid digital elevation mo...
ALT
1997
Springer
13 years 12 months ago
1997
Springer
Efficient learning of DFA is a challenging research problem in grammatical inference. It is known that both exact and approximate (in the PAC sense) identifiability of DFA is har...
FPL
2000
Springer
13 years 11 months ago
2000
Springer
Coarse-grain reconfigurable architectures have been a matter of intense research in the last few years. They promise to be more adequate for computational tasks due to their better...