Sciweavers

1321 search results - page 40 / 265
» Quadratic forms on graphs
Sort
View
ASUNAM
2011
IEEE
12 years 10 months ago
DisNet: A Framework for Distributed Graph Computation
—With the rise of network science as an exciting interdisciplinary research topic, efficient graph algorithms are in high demand. Problematically, many such algorithms measuring...
Ryan Lichtenwalter, Nitesh V. Chawla
VLDB
1999
ACM
188views Database» more  VLDB 1999»
14 years 2 months ago
Comparing Hierarchical Data in External Memory
We present an external-memory algorithm for computing a minimum-cost edit script between two rooted, ordered, labeled trees. The I/O, RAM, and CPU costs of our algorithm are, resp...
Sudarshan S. Chawathe
STOC
1990
ACM
93views Algorithms» more  STOC 1990»
14 years 2 months ago
Perfect Zero-Knowledge in Constant Rounds
Quadratic residuosity and graph isomorphism are classic problems and the canonical examples of zero-knowledge languages. However, despite much research e ort, all previous zerokno...
Mihir Bellare, Silvio Micali, Rafail Ostrovsky
SIAMCO
2008
80views more  SIAMCO 2008»
13 years 10 months ago
Optimal Transportation Problem by Stochastic Optimal Control
We solve optimal transportation problem using stochastic optimal control theory. Indeed, for a super linear cost at most quadratic at infinity, we prove Kantorovich duality theore...
Toshio Mikami, Michèle Thieullen
ENDM
2007
104views more  ENDM 2007»
13 years 10 months ago
Matching graphs of Hypercubes and Complete Bipartite Graphs
Kreweras’ conjecture [9] asserts that every perfect matching of the hypercube Qd can be extended to a Hamiltonian cycle of Qd. We [5] proved this conjecture but here we present ...
Jirí Fink