Sciweavers

3136 search results - page 425 / 628
» Comparison of Clique-Listing Algorithms
Sort
View
TCS
2010
15 years 5 months ago
Runtime analysis of a binary particle swarm optimizer
We investigate the runtime of a Binary Particle Swarm Optimizer (PSO) for optimizing pseudo-Boolean functions f : {0, 1}n → R. The Binary PSO maintains a swarm of particles sear...
Dirk Sudholt, Carsten Witt
XSYM
2010
Springer
148views Database» more  XSYM 2010»
15 years 4 months ago
Promoting the Semantic Capability of XML Keys
Keys for XML data trees can uniquely identify nodes based on the data values on some of their subnodes, either in the entire tree or relatively to some selected subtrees. Such keys...
Flavio Ferrarotti, Sven Hartmann, Sebastian Link, ...
ACL
2010
15 years 4 months ago
Structural Semantic Relatedness: A Knowledge-Based Method to Named Entity Disambiguation
Name ambiguity problem has raised urgent demands for efficient, high-quality named entity disambiguation methods. In recent years, the increasing availability of large-scale, rich...
Xianpei Han, Jun Zhao
ASAP
2010
IEEE
315views Hardware» more  ASAP 2010»
15 years 4 months ago
A compact FPGA-based architecture for elliptic curve cryptography over prime fields
Abstract--This paper proposes an FPGA-based applicationspecific elliptic curve processor over a prime field. This research targets applications for which compactness is more import...
Jo Vliegen, Nele Mentens, Jan Genoe, An Braeken, S...
CASES
2010
ACM
15 years 4 months ago
Instruction selection by graph transformation
Common generated instruction selections are based on tree pattern matching, but modern and custom architectures feature instructions, which cannot be covered by trees. To overcome...
Sebastian Buchwald, Andreas Zwinkau