2520 search results - page 211 / 504 » The complexity of approximating entropy |
181
click to vote
TIP
2008
15 years 5 months ago
2008
In this paper, a novel method for reducing the runtime complexity of a support vector machine classifier is presented. The new training algorithm is fast and simple. This is achiev...
147
click to vote
JCSS
2007
15 years 5 months ago
2007
We introduce a combinatorial dimension that characterizes the number of queries needed to exactly (or approximately) learn concept classes in various models. Our general dimension...
193
click to vote
SIGMOD
2011
ACM
14 years 8 months ago
2011
ACM
We study the problem of computing approximate quantiles in large-scale sensor networks communication-efficiently, a problem previously studied by Greenwald and Khana [12] and Shri...
322
click to vote
ICDE
2001
IEEE
16 years 7 months ago
2001
IEEE
We investigate query routing techniques in a cluster of databases for a query-dominant environment. The objective is to decrease query response time. Each component of the cluster...
150
click to vote
INFOCOM
2009
IEEE
16 years 17 days ago
2009
IEEE
— In this paper, we study sensor enabled landmine networks by formulating a minimum-cost mine selection problem. The problem arises in a target defence scenario, where the object...