Sciweavers

2715 search results - page 482 / 543
» Total Generalized Variation
Sort
View
141
Voted
CORR
2002
Springer
166views Education» more  CORR 2002»
15 years 15 days ago
Quantum Time-Space Tradeoffs for Sorting
Abstract: Although a quantum state requires exponentially many classical bits to describe, the laws of quantum mechanics impose severe restrictions on how that state can be accesse...
Hartmut Klauck
JACM
2000
86views more  JACM 2000»
15 years 15 days ago
Periodification scheme: constructing sorting networks with constant period
We consider comparator networks M that are used repeatedly: while the output produced by M is not sorted, it is fed again into M. Sorting algorithms working in this way are called ...
Miroslaw Kutylowski, Krzysztof Lorys, Brigitte Oes...
93
Voted
MST
2000
57views more  MST 2000»
15 years 14 days ago
On Scheduling Parallel Tasks at Twilight
We consider the problem of processing a given number of tasks on a given number of processors as quickly as possible when only vague information about the processing time of a task...
Hannah Bast
SIGMETRICS
2000
ACM
145views Hardware» more  SIGMETRICS 2000»
15 years 14 days ago
The incremental deployability of RTT-based congestion avoidance for high speed TCP Internet connections
Our research focuses on end-to-end congestion avoidance algorithms that use round trip time (RTT) fluctuations as an indicator of the level of network congestion. The algorithms a...
Jim Martin, Arne A. Nilsson, Injong Rhee
CACM
1998
103views more  CACM 1998»
15 years 12 days ago
The Virtual Design Team
The long range goal of the “Virtual Design Team” (VDT) research program is to develop computational tools to analyze decision making and communication behavior and thereby to ...
John C. Kunz, Tore R. Christiansen, Geoff P. Cohen...