4110 search results - page 34 / 822 » Efficient algorithms for the 2-gathering problem |
153
Voted
JCSS
2002
15 years 3 months ago
2002
We study two fundamental problems concerning the search for interesting regions in sequences: (i) given a sequence of real numbers of length n and an upper bound U; find a consecu...
125
click to vote
CIC
2004
15 years 5 months ago
2004
As a key issue in multicast routing with quality of service (QoS) support, constrained minimum Steiner tree (CMST) problem has been a research focus for more than a decade, and ten...
155
Voted
JMLR
2008
15 years 3 months ago
2008
When monitoring spatial phenomena, which can often be modeled as Gaussian processes (GPs), choosing sensor locations is a fundamental task. There are several common strategies to ...
122
Voted
AAAI
2006
15 years 5 months ago
2006
L1 regularized logistic regression is now a workhorse of machine learning: it is widely used for many classification problems, particularly ones with many features. L1 regularized...
139
Voted
HASE
2007
IEEE
15 years 7 months ago
2007
IEEE
Many problems in high assurance systems design are only tractable using computationally expensive search algorithms. For these algorithms to be useful, designers must be provided ...