4674 search results - page 772 / 935 » cases 2008 |
179
click to vote
SDM
2008
SIAM
15 years 7 months ago
2008
SIAM
In this paper, we propose a new approach to anomaly detection by looking at the latent variable space to make the first step toward latent anomaly detection. Most conventional app...
169
click to vote
SDM
2008
SIAM
15 years 7 months ago
2008
SIAM
Although clustering under constraints is a current research topic, a hierarchical setting, in which a hierarchy of clusters is the goal, is usually not considered. This paper trie...
159
click to vote
SDM
2008
SIAM
15 years 7 months ago
2008
SIAM
The Universum data, defined as a collection of "nonexamples" that do not belong to any class of interest, have been shown to encode some prior knowledge by representing ...
157
click to vote
SODA
2008
ACM
15 years 7 months ago
2008
ACM
We consider the problem of minimizing average latency cost while obliviously routing traffic in a network with linear latency functions. This is roughly equivalent to minimizing t...
177
click to vote
SODA
2008
ACM
15 years 7 months ago
2008
ACM
Greedy Routing is a class of routing algorithms in which the packets are forwarded in a manner that reduces the distance to the destination at every step. In an attempt to provide...