Sciweavers

276 search results - page 55 / 56
» Independent dynamics subspace analysis
Sort
View
ALGORITHMICA
2006
139views more  ALGORITHMICA 2006»
13 years 6 months ago
CONQUEST: A Coarse-Grained Algorithm for Constructing Summaries of Distributed Discrete Datasets
Abstract. In this paper we present a coarse-grained parallel algorithm, CONQUEST, for constructing boundederror summaries of high-dimensional binary attributed data in a distribute...
Jie Chi, Mehmet Koyutürk, Ananth Grama
JMLR
2006
169views more  JMLR 2006»
13 years 6 months ago
Bayesian Network Learning with Parameter Constraints
The task of learning models for many real-world problems requires incorporating domain knowledge into learning algorithms, to enable accurate learning from a realistic volume of t...
Radu Stefan Niculescu, Tom M. Mitchell, R. Bharat ...
TCS
2008
13 years 6 months ago
Algorithms for computing variants of the longest common subsequence problem
The longest common subsequence(LCS) problem is one of the classical and wellstudied problems in computer science. The computation of the LCS is a frequent task in DNA sequence ana...
Costas S. Iliopoulos, M. Sohel Rahman
TKDE
2011
528views more  TKDE 2011»
13 years 1 months ago
The CoQUOS Approach to Continuous Queries in Unstructured Overlays
—The current peer-to-peer (P2P) content distribution systems are constricted by their simple on-demand content discovery mechanism. The utility of these systems can be greatly en...
Lakshmish Ramaswamy, Jianxia Chen
ISCA
2011
IEEE
287views Hardware» more  ISCA 2011»
12 years 10 months ago
Scalable power control for many-core architectures running multi-threaded applications
Optimizing the performance of a multi-core microprocessor within a power budget has recently received a lot of attention. However, most existing solutions are centralized and cann...
Kai Ma, Xue Li, Ming Chen, Xiaorui Wang