Sciweavers

805 search results - page 65 / 161
» The Measurable Space of Stochastic Processes
Sort
View
ICDM
2003
IEEE
111views Data Mining» more  ICDM 2003»
15 years 3 months ago
OP-Cluster: Clustering by Tendency in High Dimensional Space
Clustering is the process of grouping a set of objects into classes of similar objects. Because of unknownness of the hidden patterns in the data sets, the definition of similari...
Jinze Liu, Wei Wang 0010
TALG
2010
158views more  TALG 2010»
14 years 4 months ago
Clustering for metric and nonmetric distance measures
We study a generalization of the k-median problem with respect to an arbitrary dissimilarity measure D. Given a finite set P of size n, our goal is to find a set C of size k such t...
Marcel R. Ackermann, Johannes Blömer, Christi...
AAAI
1998
14 years 11 months ago
Using Caching to Solve Larger Probabilistic Planning Problems
Probabilistic planning algorithms seek e ective plans for large, stochastic domains. maxplan is a recently developed algorithm that converts a planning problem into an E-Majsat pr...
Stephen M. Majercik, Michael L. Littman
WOSP
2004
ACM
15 years 3 months ago
Software performance modelling using PEPA nets
Modelling and analysing distributed and mobile software systems is a challenging task. PEPA nets—coloured stochastic Petri nets—are a recently introduced modelling formalism w...
Stephen Gilmore, Jane Hillston, Leïla Kloul, ...
PAMI
2006
146views more  PAMI 2006»
14 years 9 months ago
Attention-Based Dynamic Visual Search Using Inner-Scene Similarity: Algorithms and Bounds
A visual search is required when applying a recognition process on a scene containing multiple objects. In such cases, we would like to avoid an exhaustive sequential search. This...
Tamar Avraham, Michael Lindenbaum