Sciweavers

301 search results - page 46 / 61
» The k-Median Problem for Directed Trees
Sort
View
IPPS
2005
IEEE
14 years 1 months ago
Bootstrapping Free-Space Optical Networks
Title of thesis: BOOTSTRAPPING FREE-SPACE OPTICAL NETWORKS Fang Liu, Master of Science, 2004 Thesis directed by: Professor Uzi Vishkin Department of Electrical and Computer Engine...
Fang Liu, Uzi Vishkin, Stuart Milner
STACS
2001
Springer
13 years 12 months ago
On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs
We consider the problem of computing an optimal range assignment in a wireless network which allows a specified source station to perform a broadcast operation. In particular, we ...
Andrea E. F. Clementi, Pierluigi Crescenzi, Paolo ...
RECOMB
2007
Springer
14 years 7 months ago
Improving Inversion Median Computation Using Commuting Reversals and Cycle Information
In the past decade, genome rearrangements have attracted increasing attention from both biologists and computer scientists as a new type of data for phylogenetic analysis. Methods ...
William Arndt, Jijun Tang
CIKM
2007
Springer
14 years 1 months ago
Evaluation of partial path queries on xml data
XML query languages typically allow the specification of structural patterns of elements. Finding the occurrences of such patterns in an XML tree is the key operation in XML quer...
Stefanos Souldatos, Xiaoying Wu, Dimitri Theodorat...
HICSS
2003
IEEE
220views Biometrics» more  HICSS 2003»
14 years 24 days ago
Applications of Hidden Markov Models to Detecting Multi-Stage Network Attacks
This paper describes a novel approach using Hidden Markov Models (HMM) to detect complex Internet attacks. These attacks consist of several steps that may occur over an extended pe...
Dirk Ourston, Sara Matzner, William Stump, Bryan H...