Sciweavers

92 search results - page 6 / 19
» Reducing BDD Size by Exploiting Structural Connectivity
Sort
View
VMCAI
2010
Springer
14 years 4 months ago
Building a Calculus of Data Structures
Abstract. Techniques such as verification condition generation, preditraction, and expressive type systems reduce software verification to proving formulas in expressive logics. Pr...
Viktor Kuncak, Ruzica Piskac, Philippe Suter, Thom...
HPCC
2005
Springer
14 years 1 months ago
Adaptive Buffering-Based on Handoff Prediction for Wireless Internet Continuous Services
New challenging deployment scenarios are accommodating portable devices with limited and heterogeneous capabilities that roam among wireless access localities during service provis...
Paolo Bellavista, Antonio Corradi, Carlo Giannelli
CGF
2010
118views more  CGF 2010»
13 years 7 months ago
The Readability of Path-Preserving Clusterings of Graphs
Graph visualization systems often exploit opaque metanodes to reduce visual clutter and improve the readability of large graphs. This filtering can be done in a path-preserving wa...
Daniel Archambault, Helen C. Purchase, Bruno Pinau...
CP
2008
Springer
13 years 9 months ago
A New Empirical Study of Weak Backdoors
Abstract. Work by Kilby, Slaney, Thiebaux and Walsh [1] showed that the backdoors and backbones of unstructured Random 3SAT instances are largely disjoint. In this work we extend t...
Peter Gregory, Maria Fox, Derek Long
SIGMOD
2009
ACM
220views Database» more  SIGMOD 2009»
14 years 7 months ago
Keyword search in databases: the power of RDBMS
Keyword search in relational databases (RDBs) has been extensively studied recently. A keyword search (or a keyword query) in RDBs is specified by a set of keywords to explore the...
Lu Qin, Jeffrey Xu Yu, Lijun Chang