Sciweavers

154 search results - page 29 / 31
» Odd subgraphs and matchings
Sort
View
ARITH
1993
IEEE
14 years 1 months ago
Fast implementations of RSA cryptography
We detail and analyse the critical techniques which may be combined in the design of fast hardware for RSA cryptography: chinese remainders, star chains, Hensel's odd divisio...
Mark Shand, Jean Vuillemin
BMCBI
2007
123views more  BMCBI 2007»
13 years 9 months ago
PedGenie: meta genetic association testing in mixed family and case-control designs
Background-: PedGenie software, introduced in 2006, includes genetic association testing of cases and controls that may be independent or related (nuclear families or extended ped...
Karen Curtin, Jathine Wong, Kristina Allen-Brady, ...
ICDE
2009
IEEE
183views Database» more  ICDE 2009»
14 years 11 months ago
Efficient Indices Using Graph Partitioning in RDF Triple Stores
With the advance of the Semantic Web, varying RDF data were increasingly generated, published, queried, and reused via the Web. For example, the DBpedia, a community effort to extr...
Ying Yan, Chen Wang, Aoying Zhou, Weining Qian, Li...
ICALP
2009
Springer
14 years 10 months ago
Algorithms for Secretary Problems on Graphs and Hypergraphs
We examine several online matching problems, with applications to Internet advertising reservation systems. Consider an edge-weighted bipartite graph G, with partite sets L, R. We...
Martin Pál, Nitish Korula
FOCS
2008
IEEE
14 years 4 months ago
Embeddings of Topological Graphs: Lossy Invariants, Linearization, and 2-Sums
We study the properties of embeddings, multicommodity flows, and sparse cuts in minor-closed families of graphs which are also closed under 2-sums; this includes planar graphs, g...
Amit Chakrabarti, Alexander Jaffe, James R. Lee, J...