Sciweavers

422 search results - page 49 / 85
» Shortest paths between shortest paths and independent sets
Sort
View
INFOCOM
2003
IEEE
14 years 1 months ago
Detecting Network Intrusions via Sampling: A Game Theoretic Approach
In this paper, we consider the problem of detecting an intruding packet in a communication network. Detection is accomplished by sampling a portion of the packets transiting selec...
Murali S. Kodialam, T. V. Lakshman
IUI
2009
ACM
14 years 5 months ago
What were you thinking?: filling in missing dataflow through inference in learning from demonstration
Recent years have seen a resurgence of interest in programming by demonstration. As end users have become increasingly sophisticated, computer and artificial intelligence technolo...
Melinda T. Gervasio, Janet L. Murdock
DBA
2004
93views Database» more  DBA 2004»
13 years 10 months ago
A Query Language Solution for Fastest Flight Connections
This paper discusses how to extend the applicability of the recursive cascade update command of the Xplain query language. This command guarantees termination because cycle detect...
J. A. Bakker, J. H. ter Bekke
INFOCOM
1998
IEEE
14 years 27 days ago
Loop-Free Multipath Routing Using Generalized Diffusing Computations
A new distributed algorithm for the dynamic computation of multiple loop-free paths from source to destination in a computer network or internet are presented,validated, and analy...
William T. Zaumen, J. J. Garcia-Luna-Aceves
ALGORITHMICA
2010
95views more  ALGORITHMICA 2010»
13 years 8 months ago
Homogeneous String Segmentation using Trees and Weighted Independent Sets
We divide a string into k segments, each with only one sort of symbols, so as to minimize the total number of exceptions. Motivations come from machine learning and data mining. F...
Peter Damaschke