Sciweavers

412 search results - page 80 / 83
» Generative models for name disambiguation
Sort
View
EDBT
2009
ACM
132views Database» more  EDBT 2009»
15 years 4 months ago
A novel approach for efficient supergraph query processing on graph databases
In recent years, large amount of data modeled by graphs, namely graph data, have been collected in various domains. Efficiently processing queries on graph databases has attracted...
Shuo Zhang, Jianzhong Li, Hong Gao, Zhaonian Zou
CIKM
2009
Springer
15 years 4 months ago
Effective and efficient structured retrieval
Search engines that support structured documents typically support structure created by the author (e.g., title, section), and may also support structure added by an annotation pr...
Le Zhao, Jamie Callan
CSFW
2002
IEEE
15 years 2 months ago
Capturing Parallel Attacks within the Data Independence Framework
We carry forward the work described in our previous papers [3, 14, 12] on the application of data independence to the model checking of cryptographic protocols using CSP [13] and ...
Philippa J. Broadfoot, A. W. Roscoe
ECBS
2002
IEEE
114views Hardware» more  ECBS 2002»
15 years 2 months ago
An Intelligent Agent Security Intrusion System
Network security has now become one of the most important aspects in computer systems and the Internet. Apart from strong encryption, there is no definite method of truly securing...
J. Pikoulas, William J. Buchanan, Mike Mannion, K....
STOC
1997
ACM
125views Algorithms» more  STOC 1997»
15 years 1 months ago
An Interruptible Algorithm for Perfect Sampling via Markov Chains
For a large class of examples arising in statistical physics known as attractive spin systems (e.g., the Ising model), one seeks to sample from a probability distribution π on an...
James Allen Fill