Sciweavers

301 search results - page 20 / 61
» An efficient algorithm to verify generalized false paths
Sort
View
JUCS
2007
112views more  JUCS 2007»
13 years 8 months ago
Internet Path Behavior Prediction via Data Mining: Conceptual Framework and Case Study
: In this paper we propose an application of data mining methods in the prediction of the availability and performance of Internet paths. We deploy a general decision-making method...
Leszek Borzemski
JALC
2002
97views more  JALC 2002»
13 years 8 months ago
Semiring Frameworks and Algorithms for Shortest-Distance Problems
We define general algebraic frameworks for shortest-distance problems based on the structure of semirings. We give a generic algorithm for finding single-source shortest distances...
Mehryar Mohri
POPL
2005
ACM
14 years 8 months ago
Dynamic partial-order reduction for model checking software
We present a new approach to partial-order reduction for model checking software. This approach is based on initially exploring an arbitrary interleaving of the various concurrent...
Cormac Flanagan, Patrice Godefroid
EDBT
2008
ACM
150views Database» more  EDBT 2008»
14 years 8 months ago
Finding time-dependent shortest paths over large graphs
The spatial and temporal databases have been studied widely and intensively over years. In this paper, we study how to answer queries of finding the best departure time that minim...
Bolin Ding, Jeffrey Xu Yu, Lu Qin
CAISE
2006
Springer
14 years 6 days ago
An Efficient Approach to Support Querying Secure Outsourced XML Information
Abstract. Data security is well-recognized a vital issue in an information system that is supported in an outsource environment. However, most of conventional XML encryption propos...
Yin Yang, Wilfred Ng, Ho Lam Lau, James Cheng