Sciweavers

2192 search results - page 165 / 439
» Algorithms for Challenging Motif Problems
Sort
View
SAC
2009
ACM
15 years 11 months ago
Combining statistics and semantics via ensemble model for document clustering
Incorporating background knowledge into data mining algorithms is an important but challenging problem. Current approaches in semi-supervised learning require explicit knowledge p...
Samah Jamal Fodeh, William F. Punch, Pang-Ning Tan
189
Voted
DSN
2009
IEEE
15 years 11 months ago
A QoS-aware fault tolerant middleware for dependable service composition
Based on the framework of service-oriented architecture (SOA), complex distributed systems can be dynamically and automatically composed by integrating distributed Web services pr...
Zibin Zheng, Michael R. Lyu
128
Voted
IAT
2009
IEEE
15 years 11 months ago
Bilateral Bargaining with One-Sided Two-Type Uncertainty
It is a challenging problem to find agents’ rational strategies in bargaining with incomplete information. In this paper we perform a game theoretic analysis of agents’ ratio...
Bo An, Nicola Gatti, Victor R. Lesser
ICASSP
2009
IEEE
15 years 11 months ago
Semi-definite programming approach to sensor network node localization with anchor position uncertainty
The problem of node localization in a wireless sensor network (WSN) with the use of the incomplete and noisy distance measurements between nodes as well as anchor position informa...
Kenneth Wing-Kin Lui, Wing-Kin Ma, Hing-Cheung So,...
IV
2009
IEEE
128views Visualization» more  IV 2009»
15 years 11 months ago
Large Quasi-Tree Drawing: A Neighborhood Based Approach
In this paper, we present an algorithm to lay out a particular class of graphs coming from real case studies: the quasi-tree graph class. Protein and internet mappings projects ha...
Romain Bourqui, David Auber