Sciweavers

3616 search results - page 257 / 724
» Conditional Memory Ordering
Sort
View
125
Voted
ALGORITHMICA
2010
112views more  ALGORITHMICA 2010»
15 years 5 months ago
On Sorting, Heaps, and Minimum Spanning Trees
Let A be a set of size m. Obtaining the first k m elements of A in ascending order can be done in optimal O(m + k log k) time. We present Incremental Quicksort (IQS), an algorith...
Gonzalo Navarro, Rodrigo Paredes
CCR
2002
112views more  CCR 2002»
15 years 4 months ago
New directions in traffic measurement and accounting
Accurate network traffic measurement is required for accounting, bandwidth provisioning and detecting DoS attacks. These applications see the traffic as a collection of flows they...
Cristian Estan, George Varghese
ASPLOS
2012
ACM
14 years 24 days ago
Reflex: using low-power processors in smartphones without knowing them
To accomplish frequent, simple tasks with high efficiency, it is necessary to leverage low-power, microcontroller-like processors that are increasingly available on mobile systems...
Felix Xiaozhu Lin, Zhen Wang, Robert LiKamWa, Lin ...
ASPLOS
2012
ACM
14 years 24 days ago
Providing safe, user space access to fast, solid state disks
Emerging fast, non-volatile memories (e.g., phase change memories, spin-torque MRAMs, and the memristor) reduce storage access latencies by an order of magnitude compared to state...
Adrian M. Caulfield, Todor I. Mollov, Louis Alex E...
CVPR
2003
IEEE
16 years 7 months ago
Object Recognition Based on Photometric Alignment Using RANSAC
For object recognition under varying illumination conditions, we propose a method based on photometric alignment. The photometric alignment is known as a technique that models bot...
Takahiro Okabe, Yoichi Sato