Sciweavers

4488 search results - page 625 / 898
» Properties of NP-Complete Sets
Sort
View
SDM
2009
SIAM
167views Data Mining» more  SDM 2009»
16 years 4 months ago
Parallel Pairwise Clustering.
Given the pairwise affinity relations associated with a set of data items, the goal of a clustering algorithm is to automatically partition the data into a small number of homogen...
Elad Yom-Tov, Noam Slonim
ICWS
2009
IEEE
16 years 4 months ago
A Tool for Choreography Analysis Using Collaboration Diagrams
Analyzing interactions among peers that interact via messages is a crucial problem due to increasingly distributed nature of current software systems, especially the ones built us...
Tevfik Bultan, Chris Ferguson, Xiang Fu
ICCAD
2005
IEEE
90views Hardware» more  ICCAD 2005»
16 years 3 months ago
Scalable compositional minimization via static analysis
State-equivalence based reduction techniques, e.g. bisimulation minimization, can be used to reduce a state transition system to facilitate subsequent verification tasks. However...
Fadi A. Zaraket, Jason Baumgartner, Adnan Aziz
ICCAD
2001
IEEE
217views Hardware» more  ICCAD 2001»
16 years 3 months ago
ASF: A Practical Simulation-Based Methodology for the Synthesis of Custom Analog Circuits
: This paper describes ASF, a novel cell-level analog synthesis framework that can size and bias a given circuit topology subject to a set of performance objectives and a manufactu...
Michael Krasnicki, Rodney Phelps, James R. Hellums...
CVPR
2010
IEEE
16 years 3 months ago
A Generative Perspective on MRFs in Low-Level Vision
Markov random fields (MRFs) are popular and generic probabilistic models of prior knowledge in low-level vision. Yet their generative properties are rarely examined, while applica...
Uwe Schmidt, Qi Gao, Stefan Roth