Sciweavers

259 search results - page 38 / 52
» Graph Distances in the Data-Stream Model
Sort
View
ICDM
2006
IEEE
176views Data Mining» more  ICDM 2006»
14 years 2 months ago
Razor: mining distance-constrained embedded subtrees
Due to their capability for expressing semantics and relationships among data objects, semi-structured documents have become a common way of representing domain knowledge. Compari...
Henry Tan, Tharam S. Dillon, Fedja Hadzic, Elizabe...
PODC
2004
ACM
14 years 1 months ago
Analyzing Kleinberg's (and other) small-world Models
We analyze the properties of Small-World networks, where links are much more likely to connect “neighbor nodes” than distant nodes. In particular, our analysis provides new re...
Charles U. Martel, Van Nguyen
BPM
2005
Springer
101views Business» more  BPM 2005»
14 years 1 months ago
Service Retrieval Based on Behavioral Specifications and Quality Requirements
: The capability to easily find useful services becomes increasingly critical in several fields. In this paper we argue that, in many situations, the service discovery process shou...
Daniela Grigori, Verónika Peralta, Mokrane ...
ATMOS
2007
119views Optimization» more  ATMOS 2007»
13 years 9 months ago
Models for Railway Track Allocation
The optimal track allocation problem (OPTRA) is to find, in a given railway network, a conflict free set of train routes of maximum value. We study two types of integer programmi...
Ralf Borndörfer, Thomas Schlechte
AAAI
2010
13 years 9 months ago
Gaussian Mixture Model with Local Consistency
Gaussian Mixture Model (GMM) is one of the most popular data clustering methods which can be viewed as a linear combination of different Gaussian components. In GMM, each cluster ...
Jialu Liu, Deng Cai, Xiaofei He