420 search results - page 42 / 84 » Search on High Degree Graphs |
CSR
2007
Springer
15 years 7 months ago
2007
Springer
Consider a family of sets and a single set, called query set. How can one quickly find a member of the family which has a maximal intersection with the query set? Strict time cons...
INDOCRYPT
2003
Springer
15 years 6 months ago
2003
Springer
We develop an improved cost function to be used in simulated annealing followed by hill-climbing to find Boolean functions satisfying multiple desirable criteria such as high nonli...
98
Voted
RSP
2005
IEEE
15 years 6 months ago
2005
IEEE
Modeling DSP applications through coarse-grain dataflow graphs is popular in the DSP design community, and a growing set of rapid prototyping tools support such dataflow semantics...
112
click to vote
ESWS
2006
Springer
15 years 4 months ago
2006
Springer
A key argument for modeling knowledge in ontologies is the easy re-use and re-engineering of the knowledge. However, beside consistency checking, current ontology engineering tools...
101
Voted
IJON
2007
15 years 20 days ago
2007
Many conceptual studies of local cortical networks assume completely random wiring. For spatially extended networks, however, such random graph models are inadequate. The geometry...