Sciweavers

4212 search results - page 683 / 843
» On Compressible Pairings and Their Computation
Sort
View
AMAI
1999
Springer
15 years 6 months ago
STCSP - Structured Temporal Constraint satisfaction Problems
Temporal Constraint Satisfaction Problems (TCSP) is a well known approach for representing and processing temporal knowledge. Important properties of the knowledge can be inferred...
Mira Balaban, Tzachi Rosen
RECOMB
2005
Springer
16 years 6 months ago
Information Theoretic Approaches to Whole Genome Phylogenies
We describe a novel method for efficient reconstruction of phylogenetic trees, based on sequences of whole genomes or proteomes, whose lengths may greatly vary. The core of our me...
David Burstein, Igor Ulitsky, Tamir Tuller, Benny ...
PERCOM
2003
ACM
16 years 6 months ago
Location Aware Resource Management in Smart Homes
Abstract-- The rapid advances in a wide range of wireless access technologies along with the efficient use of smart spaces have already set the stage for development of smart homes...
Abhishek Roy, Soumya K. Das Bhaumik, Amiya Bhattac...
SIGMETRICS
2006
ACM
102views Hardware» more  SIGMETRICS 2006»
16 years 15 days ago
On the way to a distributed systems calculus: an end-to-end network calculus with data scaling
Network calculus is a min-plus system theory which facilitates the efficient derivation of performance bounds for networks of queues. It has successfully been applied to provide e...
Markus Fidler, Jens B. Schmitt
VRML
2006
ACM
16 years 15 days ago
A case for 3D streaming on peer-to-peer networks
One of the most serious issues holding back the widespread of 3D contents on Internet has been their inaccessibility due to large data volume. Many compression and progressive tra...
Shun-Yun Hu