Sciweavers

1573 search results - page 59 / 315
» A Data Structure for Sponsored Search
Sort
View
LCN
2008
IEEE
14 years 2 months ago
P2P directory search: Signature Array Hash Table
— Bloom filters are a well known data structure for approximate set membership. Bloom filters are space efficient but require many independent hashes and consecutive memory acces...
Miguel Jimeno, Kenneth J. Christensen
ENTCS
2002
80views more  ENTCS 2002»
13 years 7 months ago
Monotonic Extensions of Petri Nets: Forward and Backward Search Revisited
In this paper, we revisit the forward and backward approaches to the verification of extensions of infinite state Petri Nets. As contributions, we propose an efficient data struct...
Alain Finkel, Jean-François Raskin, Mathias...
ICML
2010
IEEE
13 years 8 months ago
Learning Markov Logic Networks Using Structural Motifs
Markov logic networks (MLNs) use firstorder formulas to define features of Markov networks. Current MLN structure learners can only learn short clauses (4-5 literals) due to extre...
Stanley Kok, Pedro Domingos
EDBT
2010
ACM
210views Database» more  EDBT 2010»
13 years 9 months ago
Keyword search for data-centric XML collections with long text fields
Users who are unfamiliar with database query languages can search XML data sets using keyword queries. Current approaches for supporting such queries are either for textcentric XM...
Arash Termehchy, Marianne Winslett
GECCO
2006
Springer
130views Optimization» more  GECCO 2006»
13 years 11 months ago
Pairwise sequence comparison for fitness evaluation in evolutionary structural software testing
Evolutionary algorithms are among the metaheuristic search methods that have been applied to the structural test data generation problem. Fitness evaluation methods play an import...
H. Turgut Uyar, A. Sima Etaner-Uyar, A. Emre Harma...