4903 search results - page 268 / 981 » The Set Covering Machine |
161
click to vote
TC
1998
15 years 6 months ago
1998
In a computer network that consists of M subnetworks, the L-bit address of a machine consists of two parts: A pre x si that contains the address of the subnetwork to which the mac...
178
click to vote
ICML
2010
IEEE
15 years 7 months ago
2010
IEEE
We consider the problem of extracting informative exemplars from a data stream. Examples of this problem include exemplarbased clustering and nonparametric inference such as Gauss...
160
click to vote
CHI
2002
ACM
16 years 7 months ago
2002
ACM
Title of Dissertation: INTERACTIVE GRAPHICAL QUERYING OF TIME SERIES AND LINEAR SEQUENCE DATA SETS Harry Hochheiser, Doctor of Philosophy, 2003 Dissertation directed by: Professor...
163
click to vote
ACSC
2007
IEEE
16 years 1 months ago
2007
IEEE
This paper presents new algorithms for computing single source shortest paths (SSSPs) in a nearly acyclic directed graph G. The first part introduces higher-order decomposition. ...
190
click to vote
ALMOB
2006
15 years 6 months ago
2006
The String Barcoding (SBC) problem, introduced by Rash and Gusfield (RECOMB, 2002), consists in finding a minimum set of substrings that can be used to distinguish between all mem...