Sciweavers

1008 search results - page 72 / 202
» Minimizing Average Flow-Time
Sort
View
SSD
2005
Springer
98views Database» more  SSD 2005»
14 years 3 months ago
Medoid Queries in Large Spatial Databases
Assume that a franchise plans to open k branches in a city, so that the average distance from each residential block to the closest branch is minimized. This is an instance of the ...
Kyriakos Mouratidis, Dimitris Papadias, Spiros Pap...
CIAC
1994
Springer
148views Algorithms» more  CIAC 1994»
14 years 2 months ago
Efficient Reorganization of Binary Search Trees
We consider the problem of maintaining a binary search tree (BST) that minimizes the average access cost needed to satisfy randomly generated requests. We analyze scenarios in whi...
Micha Hofri, Hadas Shachnai
DSN
2005
IEEE
13 years 12 months ago
Microarchitecture-Based Introspection: A Technique for Transient-Fault Tolerance in Microprocessors
The increasing transient fault rate will necessitate onchip fault tolerance techniques in future processors. The speed gap between the processor and the memory is also increasing,...
Moinuddin K. Qureshi, Onur Mutlu, Yale N. Patt
ICASSP
2010
IEEE
13 years 10 months ago
Language recognition using deep-structured conditional random fields
We present a novel language identification technique using our recently developed deep-structured conditional random fields (CRFs). The deep-structured CRF is a multi-layer CRF mo...
Dong Yu, Shizhen Wang, Zahi Karam, Li Deng
TWC
2008
143views more  TWC 2008»
13 years 9 months ago
Power-efficient wireless OFDMA using limited-rate feedback
Emerging applications involving low-cost wireless sensor networks motivate well optimization of multi-user orthogonal frequency-division multiple access (OFDMA) in the power-limite...
Antonio G. Marqués, Georgios B. Giannakis, ...