Sciweavers

40 search results - page 5 / 8
» Combinatorial Laplacian of the Matching Complex
Sort
View
PAMI
2012
11 years 11 months ago
Angular Embedding: A Robust Quadratic Criterion
Abstract—Given the size and confidence of pairwise local orderings, angular embedding (AE) finds a global ordering with a nearglobal optimal eigensolution. As a quadratic crite...
Stella Yu
ECCC
2008
168views more  ECCC 2008»
13 years 8 months ago
Algebrization: A New Barrier in Complexity Theory
Any proof of P = NP will have to overcome two barriers: relativization and natural proofs. Yet over the last decade, we have seen circuit lower bounds (for example, that PP does n...
Scott Aaronson, Avi Wigderson
ICML
2005
IEEE
14 years 9 months ago
Weighted decomposition kernels
We introduce a family of kernels on discrete data structures within the general class of decomposition kernels. A weighted decomposition kernel (WDK) is computed by dividing objec...
Sauro Menchetti, Fabrizio Costa, Paolo Frasconi
ALDT
2009
Springer
162views Algorithms» more  ALDT 2009»
14 years 3 months ago
Compact Preference Representation in Stable Marriage Problems
Abstract. The stable marriage problem has many practical applications in twosided markets like those that assign doctors to hospitals, students to schools, or buyers to vendors. Mo...
Enrico Pilotto, Francesca Rossi, Kristen Brent Ven...
ICDM
2008
IEEE
156views Data Mining» more  ICDM 2008»
14 years 3 months ago
Exploiting Local and Global Invariants for the Management of Large Scale Information Systems
This paper presents a data oriented approach to modeling the complex computing systems, in which an ensemble of correlation models are discovered to represent the system status. I...
Haifeng Chen, Haibin Cheng, Guofei Jiang, Kenji Yo...