Sciweavers

1984 search results - page 225 / 397
» The colourful feasibility problem
Sort
View
ASPDAC
2008
ACM
109views Hardware» more  ASPDAC 2008»
15 years 8 months ago
TCG-based multi-bend bus driven floorplanning
Abstract--In this paper, the problem of bus driven floorplanning is addressed. Given a set of modules and bus specifications, a floorplan solution including the bus routes will be ...
Tilen Ma, Evangeline F. Y. Young
NIPS
2008
15 years 8 months ago
Clusters and Coarse Partitions in LP Relaxations
We propose a new class of consistency constraints for Linear Programming (LP) relaxations for finding the most probable (MAP) configuration in graphical models. Usual cluster-base...
David Sontag, Amir Globerson, Tommi Jaakkola
SDM
2007
SIAM
137views Data Mining» more  SDM 2007»
15 years 7 months ago
Are approximation algorithms for consensus clustering worthwhile?
Consensus clustering has emerged as one of the principal clustering problems in the data mining community. In recent years the theoretical computer science community has generated...
Michael Bertolacci, Anthony Wirth
ECIS
2001
15 years 7 months ago
Managing the Resourcing Process in an IT Outsourcing Environment: A Case Example
A case is described of a firm, which decided to develop a new IT system using a mixture of contract or outsourced workers and company employees. The company employees were placed ...
Sue Newell, Marward Maertens
NIPS
2004
15 years 7 months ago
Maximum Margin Clustering
We propose a new method for clustering based on finding maximum margin hyperplanes through data. By reformulating the problem in terms of the implied equivalence relation matrix, ...
Linli Xu, James Neufeld, Bryce Larson, Dale Schuur...