Sciweavers

9810 search results - page 1694 / 1962
» Problems, Descriptions and Objects
Sort
View
WWW
2008
ACM
16 years 7 months ago
Composite process oriented service discovery in preserving business and timed relation
This paper proposes an approach for solving the problem of composite process oriented service discovery with preserving business and timed relation. Key to our approach is the def...
Yu Dai, Lei Yang, Bin Zhang, Kening Gao
WWW
2006
ACM
16 years 7 months ago
Dynamic placement for clustered web applications
We introduce and evaluate a middleware clustering technology capable of allocating resources to web applications through dynamic application instance placement. We define applicat...
A. Karve, Tracy Kimbrel, Giovanni Pacifici, Mike S...
WWW
2004
ACM
16 years 7 months ago
Type based service composition
Service matchmaking and composition has recently drawn increasing attention in the research community. Most existing algorithms construct chains of services based on exact matches...
Ion Constantinescu, Boi Faltings, Walter Binder
CP
2009
Springer
16 years 7 months ago
Minimising Decision Tree Size as Combinatorial Optimisation
Decision tree induction techniques attempt to find small trees that fit a training set of data. This preference for smaller trees, which provides a learning bias, is often justifie...
Christian Bessiere, Emmanuel Hebrard, Barry O'Sull...
KDD
2005
ACM
137views Data Mining» more  KDD 2005»
16 years 7 months ago
Pattern-based similarity search for microarray data
One fundamental task in near-neighbor search as well as other similarity matching efforts is to find a distance function that can efficiently quantify the similarity between two o...
Haixun Wang, Jian Pei, Philip S. Yu
« Prev « First page 1694 / 1962 Last » Next »