Sciweavers

2266 search results - page 371 / 454
» Generalizing parametric timing analysis
Sort
View
KDD
2010
ACM
245views Data Mining» more  KDD 2010»
14 years 1 months ago
Flexible constrained spectral clustering
Constrained clustering has been well-studied for algorithms like K-means and hierarchical agglomerative clustering. However, how to encode constraints into spectral clustering rem...
Xiang Wang, Ian Davidson
AAAI
2006
13 years 11 months ago
Computing Slater Rankings Using Similarities among Candidates
Voting (or rank aggregation) is a general method for aggregating the preferences of multiple agents. One important voting rule is the Slater rule. It selects a ranking of the alte...
Vincent Conitzer
JACM
2007
160views more  JACM 2007»
13 years 10 months ago
Lossless abstraction of imperfect information games
abstraction of imperfect information games ANDREW GILPIN and TUOMAS SANDHOLM Computer Science Department Carnegie Mellon University Pittsburgh, PA, USA Finding an equilibrium of an...
Andrew Gilpin, Tuomas Sandholm
WABI
2010
Springer
128views Bioinformatics» more  WABI 2010»
13 years 8 months ago
Sparsification of RNA Structure Prediction Including Pseudoknots
Background: Although many RNA molecules contain pseudoknots, computational prediction of pseudoknotted RNA structure is still in its infancy due to high running time and space con...
Mathias Möhl, Raheleh Salari, Sebastian Will,...
VEE
2012
ACM
238views Virtualization» more  VEE 2012»
12 years 5 months ago
Replacement attacks against VM-protected applications
Process-level virtualization is increasingly being used to enhance the security of software applications from reverse engineering and unauthorized modification (called software p...
Sudeep Ghosh, Jason Hiser, Jack W. Davidson