Sciweavers

3934 search results - page 679 / 787
» Approximate Schedulability Analysis
Sort
View
MOBICOM
2004
ACM
15 years 11 months ago
Modeling mobility for vehicular ad-hoc networks
Without realistic modeling of node mobility, simulation evaluation of performance of mobile ad hoc networks may not correlate well with performance in a real deployment. In this p...
Amit Kumar Saha, David B. Johnson
SIGIR
2004
ACM
15 years 11 months ago
GaP: a factor model for discrete data
We present a probabilistic model for a document corpus that combines many of the desirable features of previous models. The model is called “GaP” for Gamma-Poisson, the distri...
John F. Canny
APPROX
2004
Springer
136views Algorithms» more  APPROX 2004»
15 years 11 months ago
On the Crossing Spanning Tree Problem
Given an undirected n-node graph and a set C of m cuts, the minimum crossing tree is a spanning tree which minimizes the maximum crossing of any cut in C, where the crossing of a c...
Vittorio Bilò, Vineet Goyal, R. Ravi, Mohit...
ARCS
2004
Springer
15 years 11 months ago
Heterogenous Data Fusion via a Probabilistic Latent-Variable Model
In a pervasive computing environment, one is facing the problem of handling heterogeneous data from different sources, transmitted over heterogeneous channels and presented on het...
Kai Yu, Volker Tresp
CIKM
2004
Springer
15 years 11 months ago
Indexing text data under space constraints
An important class of queries is the LIKE predicate in SQL. In the absence of an index, LIKE queries are subject to performance degradation. The notion of indexing on substrings (...
Bijit Hore, Hakan Hacigümüs, Balakrishna...