3415 search results - page 389 / 683 » Lower bounds on kernelization |
152
click to vote
PKDD
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Partially ordered feature sets appear naturally in many classification settings with structured input instances, for example, when the data instances are graphs and a fe...
160
click to vote
ICC
2007
IEEE
16 years 29 days ago
2007
IEEE
—In this paper the Cramér-Rao lower bound (CRLB) of an ultra-wideband (UWB) pulse amplitude modulated (PAM) signal with time hopping (TH) code is derived for the practical case ...
165
click to vote
PPOPP
2006
ACM
16 years 18 days ago
2006
ACM
Traditional collective communication algorithms are designed with the assumption that a node can communicate with only one other node at a time. On new parallel architectures such...
139
click to vote
SSDBM
2005
IEEE
16 years 7 days ago
2005
IEEE
Similarity-based querying of time series data can be categorized as pattern existence queries and shape match queries. Pattern existence queries find the time series data with ce...
163
Voted
SIGECOM
2005
ACM
16 years 6 days ago
2005
ACM
We address the problem of lowering the buyer’s expected payments in shortest path auctions, where the buyer’s goal is to purchase a path in a graph in which edges are owned by...