Sciweavers

2200 search results - page 276 / 440
» Bloch's Constant is Computable
Sort
View
WG
2005
Springer
15 years 12 months ago
Collective Tree 1-Spanners for Interval Graphs
Abstract. In this paper we study the existence of a small set T of spanning trees that collectively “1-span” an interval graph G. In particular, for any pair of vertices u, v w...
Derek G. Corneil, Feodor F. Dragan, Ekkehard K&oum...
CSCW
2004
ACM
15 years 12 months ago
QnA: augmenting an instant messaging client to balance user responsiveness and performance
The growing use of Instant Messaging for social and work-related communication has created a situation where incoming messages often become a distraction to users while they are p...
Daniel Avrahami, Scott E. Hudson
SPAA
2004
ACM
15 years 12 months ago
Online hierarchical cooperative caching
We address a hierarchical generalization of the well-known disk paging problem. In the hierarchical cooperative caching problem, a set of n machines residing in an ultrametric spa...
Xiaozhou Li, C. Greg Plaxton, Mitul Tiwari, Arun V...
ANTS
2004
Springer
139views Algorithms» more  ANTS 2004»
15 years 12 months ago
Binary GCD Like Algorithms for Some Complex Quadratic Rings
On the lines of the binary gcd algorithm for rational integers, algorithms for computing the gcd are presented for the ring of integers in Q( √ d) where d ∈ {−2, −7, −11,...
Saurabh Agarwal, Gudmund Skovbjerg Frandsen
BIRTHDAY
2004
Springer
15 years 12 months ago
Communicating Mobile Processes
This paper presents a new model for mobile processes in occam-π. A process, embedded anywhere in a dynamically evolving network, may suspend itself mid-execution, be safely discon...
Peter H. Welch, Fred R. M. Barnes