Sciweavers

8109 search results - page 1217 / 1622
» A Model of Component-Based Programming
Sort
View
HPCA
2003
IEEE
16 years 6 months ago
Active I/O Switches in System Area Networks
We present an active switch architecture to improve the performance of systems connected via system area networks. Our programmable active switches not only flexibly route packets...
Ming Hao, Mark Heinrich
CHI
2003
ACM
16 years 6 months ago
Fusion: interactive coordination of diverse data, visualizations, and mining algorithms
Fusion is a web-based system that enables end-users to rapidly and dynamically construct personalized visualization workspaces without programming. Users first use advanced data s...
Chris North, Nathan Conklin, Kiran Indukuri, Varun...
154
Voted
STOC
2001
ACM
116views Algorithms» more  STOC 2001»
16 years 6 months ago
One line and n points
: We analyze a randomized pivoting process involving one line and n points in the plane. The process models the behavior of the RANDOM-EDGE simplex algorithm on simple polytopes wi...
Bernd Gärtner, József Solymosi, Falk T...
ICALP
2009
Springer
16 years 6 months ago
Towards a Study of Low-Complexity Graphs
Abstract. We propose the study of graphs that are defined by lowcomplexity distributed and deterministic agents. We suggest that this viewpoint may help introduce the element of in...
Sanjeev Arora, David Steurer, Avi Wigderson
160
Voted
ICALP
2009
Springer
16 years 6 months ago
B-Treaps: A Uniquely Represented Alternative to B-Trees
We present the first uniquely represented data structure for an external memory model of computation, a B-tree analogue called a B-treap. Uniquely represented data structures repre...
Daniel Golovin
« Prev « First page 1217 / 1622 Last » Next »