Sciweavers

2853 search results - page 513 / 571
» On the Efficiency of Provenance Queries
Sort
View
FUN
2010
Springer
230views Algorithms» more  FUN 2010»
15 years 3 months ago
O(1)-Time Unsorting by Prefix-Reversals in a Boustrophedon Linked List
Conventional wisdom suggests that O(k)-time is required to reverse a substring of length k. To reduce this time complexity, a simple and unorthodox data structure is introduced. A ...
Aaron Williams
AAAI
2008
15 years 2 months ago
Lifted Probabilistic Inference with Counting Formulas
Lifted inference algorithms exploit repeated structure in probabilistic models to answer queries efficiently. Previous work such as de Salvo Braz et al.'s first-order variabl...
Brian Milch, Luke S. Zettlemoyer, Kristian Kerstin...
LISA
2007
15 years 2 months ago
PolicyVis: Firewall Security Policy Visualization and Inspection
Firewalls have an important role in network security. However, managing firewall policies is an extremely complex task because the large number of interacting rules in single or d...
Tung Tran, Ehab S. Al-Shaer, Raouf Boutaba
CIKM
2008
Springer
15 years 1 months ago
Workload-based optimization of integration processes
The efficient execution of integration processes between distributed, heterogeneous data sources and applications is a challenging research area of data management. These inn proc...
Matthias Böhm, Uwe Wloka, Dirk Habich, Wolfga...
CIKM
2008
Springer
15 years 1 months ago
Dynamic faceted search for discovery-driven analysis
We propose a dynamic faceted search system for discoverydriven analysis on data with both textual content and structured attributes. From a keyword query, we want to dynamically s...
Debabrata Dash, Jun Rao, Nimrod Megiddo, Anastasia...