Sciweavers

2192 search results - page 95 / 439
» Algorithms for Challenging Motif Problems
Sort
View
ICDM
2003
IEEE
130views Data Mining» more  ICDM 2003»
14 years 1 months ago
Information Theoretic Clustering of Sparse Co-Occurrence Data
A novel approach to clustering co-occurrence data poses it as an optimization problem in information theory which minimizes the resulting loss in mutual information. A divisive cl...
Inderjit S. Dhillon, Yuqiang Guan
JAIR
2008
119views more  JAIR 2008»
13 years 8 months ago
A Multiagent Reinforcement Learning Algorithm with Non-linear Dynamics
Several multiagent reinforcement learning (MARL) algorithms have been proposed to optimize agents' decisions. Due to the complexity of the problem, the majority of the previo...
Sherief Abdallah, Victor R. Lesser
ALGORITHMICA
1999
141views more  ALGORITHMICA 1999»
13 years 7 months ago
Design and Implementation of a Practical Parallel Delaunay Algorithm
Abstract. This paper describes the design and implementation of a practical parallel algorithm for Delaunay triangulation that works well on general distributions. Although there h...
Guy E. Blelloch, Jonathan C. Hardwick, Gary L. Mil...
CORR
2011
Springer
158views Education» more  CORR 2011»
13 years 3 months ago
SqFreeEVAL: An (almost) optimal real-root isolation algorithm
Let f be a univariate polynomial with real coefficients, f ∈ R[X]. Subdivision algorithms based on algebraic techniques (e.g., Sturm or Descartes methods) are widely used for is...
Michael Burr, Felix Krahmer
JDCTA
2010
119views more  JDCTA 2010»
13 years 3 months ago
Distributed Dual Cluster Algorithm Based on Grid for Sensor Streams
In practical applications, Wireless Sensor Networks generate massive data streams with the dual attributes in geography and optimization domain. Energy source of sensor nodes in W...
Jianghua Huang, Junying Zhang