Sciweavers

1376 search results - page 83 / 276
» Searching Trees: An Essay
Sort
View
FUIN
2006
81views more  FUIN 2006»
14 years 12 months ago
Indexing Schemes for Similarity Search: an Illustrated Paradigm
We suggest a variation of the Hellerstein-Koutsoupias--Papadimitriou indexability model for datasets equipped with a similarity measure, with the aim of better understanding the s...
Vladimir Pestov, Aleksandar Stojmirovic
AAAI
2000
15 years 1 months ago
A Distributed Algorithm to Evaluate Quantified Boolean Formulae
In this paper, we present PQSOLVE, a distributed theorem-prover for Quantified Boolean Formulae. First, we introduce our sequential algorithm QSOLVE, which uses new heuristics and...
Rainer Feldmann, Burkhard Monien, Stefan Schamberg...
INFOCOM
2010
IEEE
14 years 10 months ago
High Performance Dictionary-Based String Matching for Deep Packet Inspection
—Dictionary-Based String Matching (DBSM) is used in network Deep Packet Inspection (DPI) applications virus scanning [1] and network intrusion detection [2]. We propose the Pipel...
Yi-Hua Edward Yang, Hoang Le, Viktor K. Prasanna
AI
2006
Springer
14 years 12 months ago
Cut-and-solve: An iterative search strategy for combinatorial optimization problems
Branch-and-bound and branch-and-cut use search trees to identify optimal solutions to combinatorial optimization problems. In this paper, we introduce an iterative search strategy...
Sharlee Climer, Weixiong Zhang
KDD
2003
ACM
150views Data Mining» more  KDD 2003»
16 years 9 days ago
Learning relational probability trees
Classification trees are widely used in the machine learning and data mining communities for modeling propositional data. Recent work has extended this basic paradigm to probabili...
Jennifer Neville, David Jensen, Lisa Friedland, Mi...