Sciweavers

4622 search results - page 325 / 925
» Foundations of Information Theory
Sort
View
CHI
2007
ACM
15 years 10 months ago
A familiar face(book): profile elements as signals in an online social network
Using data from a popular online social network site, this paper explores the relationship between profile structure (namely, which fields are completed) and number of friends, gi...
Cliff Lampe, Nicole Ellison, Charles Steinfield
MOBIHOC
2002
ACM
16 years 6 months ago
On the minimum node degree and connectivity of a wireless multihop network
This paper investigates two fundamental characteristics of a wireless multihop network: its minimum node degree and its k?connectivity. Both topology attributes depend on the spat...
Christian Bettstetter
COMPGEOM
2009
ACM
16 years 1 months ago
Near-linear approximation algorithms for geometric hitting sets
Given a set system (X, R), the hitting set problem is to find a smallest-cardinality subset H ⊆ X, with the property that each range R ∈ R has a non-empty intersection with H...
Pankaj K. Agarwal, Esther Ezra, Micha Sharir
ECRTS
2007
IEEE
16 years 1 months ago
A Delay Composition Theorem for Real-Time Pipelines
Uniprocessor schedulability theory made great strides, in part, due to the simplicity of composing the delay of a job from the execution times of higher-priority jobs that preempt...
Praveen Jayachandran, Tarek F. Abdelzaher
SIGMETRICS
2006
ACM
102views Hardware» more  SIGMETRICS 2006»
16 years 24 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