Sciweavers

342 search results - page 40 / 69
» Constrained Integer Partitions
Sort
View
ESA
2009
Springer
109views Algorithms» more  ESA 2009»
15 years 2 months ago
Linear-Time Recognition of Probe Interval Graphs
The interval graph for a set of intervals on a line consists of one vertex for each interval, and an edge for each intersecting pair of intervals. A probe interval graph is a varia...
Ross M. McConnell, Yahav Nussbaum
ICPR
2008
IEEE
15 years 4 months ago
Clustering by evidence accumulation on affinity propagation
If there are more clusters than the ideal, each intrinsic cluster will be split into several subsets. Theoretically, this split can be arbitrary and neighboring data points have a ...
Xuqing Zhang, Fei Wu, Yueting Zhuang
UAI
2003
14 years 11 months ago
On Triangulating Dynamic Graphical Models
This paper introduces improved methodology to triangulate dynamic graphical models and dynamic Bayesian networks (DBNs). In this approach, a standard DBN template can be modified...
Jeff A. Bilmes, Chris Bartels
COCOON
2005
Springer
15 years 3 months ago
Interval Subset Sum and Uniform-Price Auction Clearing
Abstract. We study the interval subset sum problem (ISSP), a generalization of the classic subset-sum problem, where given a set of intervals, the goal is to choose a set of intege...
Anshul Kothari, Subhash Suri, Yunhong Zhou
HPDC
2006
IEEE
15 years 3 months ago
Task Scheduling and File Replication for Data-Intensive Jobs with Batch-shared I/O
This paper addresses the problem of efficient execution of a batch of data-intensive tasks with batch-shared I/O behavior, on coupled storage and compute clusters. Two scheduling...
Gaurav Khanna 0002, Nagavijayalakshmi Vydyanathan,...