Sciweavers

941 search results - page 55 / 189
» Efficient Testing of Large Graphs
Sort
View
BMCBI
2010
156views more  BMCBI 2010»
14 years 10 months ago
Mathematical model for empirically optimizing large scale production of soluble protein domains
Background: Efficient dissection of large proteins into their structural domains is critical for high throughput proteome analysis. So far, no study has focused on mathematically ...
Eisuke Chikayama, Atsushi Kurotani, Takanori Tanak...
ICML
2007
IEEE
15 years 10 months ago
Learning distance function by coding similarity
We consider the problem of learning a similarity function from a set of positive equivalence constraints, i.e. 'similar' point pairs. We define the similarity in informa...
Aharon Bar-Hillel, Daphna Weinshall
AAAI
1994
14 years 11 months ago
Improving Repair-Based Constraint Satisfaction Methods by Value Propagation
A constraint satisfaction problem (CSP) is a problem to find an assignment that satisfies given constraints. An interesting approach to CSP is a repair-based method that first gen...
Nobuhiro Yugami, Yuiko Ohta, Hirotaka Hara
SDM
2008
SIAM
256views Data Mining» more  SDM 2008»
14 years 11 months ago
Graph Mining with Variational Dirichlet Process Mixture Models
Graph data such as chemical compounds and XML documents are getting more common in many application domains. A main difficulty of graph data processing lies in the intrinsic high ...
Koji Tsuda, Kenichi Kurihara
MASCOTS
2010
14 years 11 months ago
PAC: Pattern-driven Application Consolidation for Efficient Cloud Computing
To reduce cloud system resource cost, application consolidation is a must. In this paper, we present a novel patterndriven application consolidation (PAC) system to achieve efficie...
Zhenhuan Gong, Xiaohui Gu