Sciweavers

868 search results - page 95 / 174
» Finding Most Likely Solutions
Sort
View
KDD
2006
ACM
142views Data Mining» more  KDD 2006»
14 years 10 months ago
Mining distance-based outliers from large databases in any metric space
Let R be a set of objects. An object o R is an outlier, if there exist less than k objects in R whose distances to o are at most r. The values of k, r, and the distance metric ar...
Yufei Tao, Xiaokui Xiao, Shuigeng Zhou
CLUSTER
2003
IEEE
14 years 3 months ago
"Plug-and-Play" Cluster Computing Using Mac OS X
At UCLA's Plasma Physics Group, to achieve accessible computational power for our research goals, we developed the tools to build numerically-intensive parallel computing clu...
Dean E. Dauger, Viktor K. Decyk
ICC
2007
IEEE
162views Communications» more  ICC 2007»
14 years 2 months ago
LSP and Back Up Path Setup in MPLS Networks Based on Path Criticality Index
This paper reports on a promising approach for solving problems found when Multi Protocol Label Switching (MPLS), soon to be a dominant protocol, is used in core network systems. D...
Ali Tizghadam, Alberto Leon-Garcia
COR
2006
94views more  COR 2006»
13 years 10 months ago
Computing obnoxious 1-corner polygonal chains
We consider an obnoxious facility location problem in which the facility is a trajectory consisting of a bounded length polygonal chain of two edges having extremes anchored at tw...
José Miguel Díaz-Báñez...
WAPCV
2004
Springer
14 years 3 months ago
Towards a Biologically Plausible Active Visual Search Model
Abstract. This paper proposes a neuronal-based solution to active visual search, that is, visual search for a given target in displays that are too large in spatial extent to be in...
Andrei Zaharescu, Albert L. Rothenstein, John K. T...