Sciweavers

4302 search results - page 763 / 861
» Index Pairs Algorithms
Sort
View
INFOCOM
2005
IEEE
14 years 2 months ago
Link scheduling in sensor networks: distributed edge coloring revisited
— We consider the problem of link scheduling in a sensor network employing a TDMA MAC protocol. Our link scheduling algorithm involves two phases. In the first phase, we assign ...
Shashidhar Gandham, Milind Dawande, Ravi Prakash
PAM
2005
Springer
14 years 2 months ago
A Merged Inline Measurement Method for Capacity and Available Bandwidth
— We have proposed a new TCP version, called ImTCP (Inline measurement TCP), in [1]. The ImTCP sender adjusts the transmission intervals of data packets, and then utilizes the ar...
Cao Le Thanh Man, Go Hasegawa, Masayuki Murata
WAOA
2005
Springer
142views Algorithms» more  WAOA 2005»
14 years 2 months ago
On the Minimum Load Coloring Problem
Given a graph G = (V, E) with n vertices, m edges and maximum vertex degree ∆, the load distribution of a coloring ϕ : V → {red, blue} is a pair dϕ = (rϕ, bϕ), where rϕ i...
Nitin Ahuja, Andreas Baltz, Benjamin Doerr, Ales P...
SAC
2004
ACM
14 years 2 months ago
Forest trees for on-line data
This paper presents an hybrid adaptive system for induction of forest of trees from data streams. The Ultra Fast Forest Tree system (UFFT) is an incremental algorithm, with consta...
João Gama, Pedro Medas, Ricardo Rocha
ICFCA
2004
Springer
14 years 2 months ago
Automated Lattice Drawing
Lattice diagrams, known as Hasse diagrams, have played an ever increasing role in lattice theory and fields that use lattices as a tool. Initially regarded with suspicion, they no...
Ralph Freese