Sciweavers

652 search results - page 104 / 131
» fast 2004
Sort
View
ISW
2004
Springer
14 years 28 days ago
Re-thinking Security in IP Based Micro-Mobility
Security problems in micro-mobility are mostly related to trust establishment between mobile nodes and middle-boxes, i.e. mobile anchor points. In this paper, we present a secure m...
Jukka Ylitalo, Jan Melén, Pekka Nikander, V...
IWPEC
2004
Springer
14 years 28 days ago
Perfect Path Phylogeny Haplotyping with Missing Data Is Fixed-Parameter Tractable
Abstract. Haplotyping via perfect phylogeny is a method for retrieving haplotypes from genotypes. Fast algorithms are known for computing perfect phylogenies from complete and erro...
Jens Gramm, Till Nierhoff, Till Tantau
KDD
2004
ACM
145views Data Mining» more  KDD 2004»
14 years 28 days ago
A graph-theoretic approach to extract storylines from search results
We present a graph-theoretic approach to discover storylines from search results. Storylines are windows that offer glimpses into interesting themes latent among the top search re...
Ravi Kumar, Uma Mahadevan, D. Sivakumar
PAM
2004
Springer
14 years 28 days ago
Measuring BGP Pass-Through Times
Fast routing convergence is a key requirement for services that rely on stringent QoS. Yet experience has shown that the standard inter-domain routing protocol, BGP4, takes, at tim...
Anja Feldmann, Hongwei Kong, Olaf Maennel, Alexand...
PAM
2004
Springer
14 years 28 days ago
Geometric Exploration of the Landmark Selection Problem
Abstract. Internet coordinate systems appear promising as a method for estimating network distance without direct measurement, allowing scalable configuration of emerging applicat...
Liying Tang, Mark Crovella