Sciweavers

9842 search results - page 1471 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
ICDM
2005
IEEE
185views Data Mining» more  ICDM 2005»
16 years 20 days ago
Semi-Supervised Mixture of Kernels via LPBoost Methods
We propose an algorithm to construct classification models with a mixture of kernels from labeled and unlabeled data. The derived classifier is a mixture of models, each based o...
Jinbo Bi, Glenn Fung, Murat Dundar, R. Bharat Rao
ICTAI
2005
IEEE
16 years 19 days ago
Good Learning and Implicit Model Enumeration
A large number of practical applications rely on effective algorithms for propositional model enumeration and counting. Examples include knowledge compilation, model checking and ...
António Morgado, João P. Marques Sil...
ISCAS
2005
IEEE
115views Hardware» more  ISCAS 2005»
16 years 19 days ago
Power-aware slack distribution for hierarchical VLSI design
Abstract— Hierarchical design plays an important role in microprocessor and ASIC domains where design complexity limits design productivity and tool capacity. Slack distribution,...
Hyung-Ock Kim, Youngsoo Shin
NCA
2005
IEEE
16 years 19 days ago
Slingshot: Time-Critical Multicast for Clustered Applications
Datacenters are complex environments consisting of thousands of failure-prone commodity components connected by fast, high-capacity interconnects. The software running on such dat...
Mahesh Balakrishnan, Stefan Pleisch, Ken Birman
QSIC
2005
IEEE
16 years 19 days ago
Formal Fault Tree Analysis of State Transition Systems
Fault Tree Analysis (FTA) is a traditional deductive safety analysis technique that is applied during the system design stage. However, traditional FTA does not consider transitio...
Jianwen Xiang, Kazuhiro Ogata
« Prev « First page 1471 / 1969 Last » Next »