Sciweavers

1188 search results - page 151 / 238
» Extended Graph Unification
Sort
View
COR
2008
142views more  COR 2008»
14 years 9 months ago
Modeling and solving the rooted distance-constrained minimum spanning tree problem
In this paper we discuss models and methods for solving the rooted distance constrained minimum spanning tree problem which is defined as follows: given a graph G = (V, E) with no...
Luis Gouveia, Ana Paias, Dushyant Sharma
CORR
2010
Springer
136views Education» more  CORR 2010»
14 years 9 months ago
Maximum Bipartite Matching Size And Application to Cuckoo Hashing
Cuckoo hashing with a stash is a robust high-performance hashing scheme that can be used in many real-life applications. It complements cuckoo hashing by adding a small stash stor...
Josef Kanizo, David Hay, Isaac Keslassy
CSR
2011
Springer
14 years 1 months ago
The Complexity of Inversion of Explicit Goldreich's Function by DPLL Algorithms
The Goldreich’s function has n binary inputs and n binary outputs. Every output depends on d inputs and is computed from them by the fixed predicate of arity d. Every Goldreich...
Dmitry Itsykson, Dmitry Sokolov
POPL
2007
ACM
15 years 10 months ago
Specialization of CML message-passing primitives
Concurrent ML (CML) is a statically-typed higher-order concurrent language that is embedded in Standard ML. Its most notable feature is its support for first-class synchronous ope...
John H. Reppy, Yingqi Xiao
WWW
2007
ACM
15 years 10 months ago
SPARQ2L: towards support for subgraph extraction queries in rdf databases
Many applications in analytical domains often have the need to "connect the dots" i.e., query about the structure of data. In bioinformatics for example, it is typical t...
Kemafor Anyanwu, Angela Maduko, Amit P. Sheth