Sciweavers

1396 search results - page 144 / 280
» aim 2006
Sort
View
JCSS
2002
199views more  JCSS 2002»
15 years 12 days ago
A Constant-Factor Approximation Algorithm for the k-Median Problem
We present the first constant-factor approximation algorithm for the metric k-median problem. The k-median problem is one of the most well-studied clustering problems, i.e., those...
Moses Charikar, Sudipto Guha, Éva Tardos, D...
95
Voted
JHSN
2002
80views more  JHSN 2002»
15 years 12 days ago
A network architecture for providing per-flow delay guarantees with scalable core
Abstract. Many real-time applications demand delay guarantees from the network. A network architecture designed to support these applications should be robust and scalable. The Int...
Prasanna Chaporkar, Joy Kuri
JIIS
2002
99views more  JIIS 2002»
15 years 12 days ago
Efficient Management of Persistent Knowledge
Although computer speed has steadily increased and memory is getting cheaper, the need for storage managers to deal efficiently with applications that cannot be held into main memo...
Dimitris G. Kapopoulos, Michael Hatzopoulos, Panag...
116
Voted
JIIS
2002
119views more  JIIS 2002»
15 years 12 days ago
Spatio-Temporal Data Mining for Typhoon Image Collection
Our research aims at discovering useful knowledge from the large collection of satellite images of typhoons using data mining approaches. We first introduce the creation of the typ...
Asanobu Kitamoto
97
Voted
JETAI
1998
110views more  JETAI 1998»
15 years 12 days ago
Independency relationships and learning algorithms for singly connected networks
Graphical structures such as Bayesian networks or Markov networks are very useful tools for representing irrelevance or independency relationships, and they may be used to e cientl...
Luis M. de Campos