Sciweavers

670 search results - page 33 / 134
» Intractability and clustering with constraints
Sort
View
NIPS
2003
15 years 2 months ago
Computing Gaussian Mixture Models with EM Using Equivalence Constraints
Density estimation with Gaussian Mixture Models is a popular generative technique used also for clustering. We develop a framework to incorporate side information in the form of e...
Noam Shental, Aharon Bar-Hillel, Tomer Hertz, Daph...
IPPS
2008
IEEE
15 years 7 months ago
NETEMBED: A network resource mapping service for distributed applications
Emerging configurable infrastructures (large-scale overlays, grids, distributed testbeds, and sensor networks among others) comprise diverse sets of computing resources and netwo...
Jorge Londoño, Azer Bestavros
RTCSA
2005
IEEE
15 years 7 months ago
Task Partitioning upon Memory-Constrained Multiprocessors
Most prior theoretical research on partitioning algorithms for real-time multiprocessor platforms has focused on ensuring that the cumulative computing requirements of the tasks a...
Nathan Fisher, James H. Anderson, Sanjoy K. Baruah
120
Voted
MFCS
2001
Springer
15 years 5 months ago
Playing Games with Algorithms: Algorithmic Combinatorial Game Theory
Combinatorial games lead to several interesting, clean problems in algorithms and complexity theory, many of which remain open. The purpose of this paper is to provide an overview...
Erik D. Demaine
CP
2004
Springer
15 years 5 months ago
Full Dynamic Substitutability by SAT Encoding
Symmetry in constraint problems can be exploited to greatly improve search performance. A form of symmetry that has been the subject of considerable research is value interchangeab...
Steven David Prestwich