Sciweavers

670 search results - page 93 / 134
» Intractability and clustering with constraints
Sort
View
IJCAI
2007
15 years 2 months ago
MB-DPOP: A New Memory-Bounded Algorithm for Distributed Optimization
In distributed combinatorial optimization problems, dynamic programming algorithms like DPOP ([Petcu and Faltings, 2005]) require only a linear number of messages, thus generating...
Adrian Petcu, Boi Faltings
ADMA
2010
Springer
264views Data Mining» more  ADMA 2010»
14 years 11 months ago
Frequent Pattern Trend Analysis in Social Networks
Abstract. This paper describes an approach to identifying and comparing frequent pattern trends in social networks. A frequent pattern trend is defined as a sequence of time-stampe...
Puteri N. E. Nohuddin, Rob Christley, Frans Coenen...
SCHOLARPEDIA
2011
14 years 4 months ago
N-body simulations
Abstract. Scientists’ ability to generate and collect massive-scale datasets is increasing. As a result, constraints in data analysis capability rather than limitations in the av...
PAMI
2012
13 years 3 months ago
Angular Embedding: A Robust Quadratic Criterion
Abstract—Given the size and confidence of pairwise local orderings, angular embedding (AE) finds a global ordering with a nearglobal optimal eigensolution. As a quadratic crite...
Stella Yu
BMCBI
2007
133views more  BMCBI 2007»
15 years 1 months ago
Semi-supervised learning for the identification of syn-expressed genes from fused microarray and in situ image data
Background: Gene expression measurements during the development of the fly Drosophila melanogaster are routinely used to find functional modules of temporally co-expressed genes. ...
Ivan G. Costa, Roland Krause, Lennart Opitz, Alexa...