Sciweavers

2354 search results - page 143 / 471
» A Common-Sense Theory of Time
Sort
View
ASC
2011
13 years 3 months ago
A rough set approach to multiple dataset analysis
In the area of data mining, the discovery of valuable changes and connections (e.g., causality) from multiple data sets has been recognized as an important issue. This issue essen...
Ken Kaneiwa
STOC
2009
ACM
155views Algorithms» more  STOC 2009»
14 years 9 months ago
A nearly optimal oracle for avoiding failed vertices and edges
We present an improved oracle for the distance sensitivity problem. The goal is to preprocess a directed graph G = (V, E) with non-negative edge weights to answer queries of the f...
Aaron Bernstein, David R. Karger
INFOCOM
2009
IEEE
14 years 2 months ago
The Impact of Mobility on Gossip Algorithms
—We analyze how node mobility can influence the convergence time of averaging gossip algorithms on networks. Our main result is that even a small number of fully mobile nodes ca...
Anand D. Sarwate, Alexandros G. Dimakis
IPPS
2009
IEEE
14 years 2 months ago
Multi-users scheduling in parallel systems
We are interested in this paper to study scheduling problems in systems where many users compete to perform their respective jobs on shared parallel resources. Each user has speci...
Erik Saule, Denis Trystram
SIGMETRICS
2006
ACM
121views Hardware» more  SIGMETRICS 2006»
14 years 2 months ago
Transient analysis of tree-Like processes and its application to random access systems
A new methodology to assess transient performance measures of tree-like processes is proposed by introducing the concept of tree-like processes with marked time epochs. As opposed...
Jeroen Van Velthoven, Benny Van Houdt, Chris Blond...