Sciweavers

2512 search results - page 335 / 503
» Software Transactional Memory
Sort
View
122
Voted
NA
2010
117views more  NA 2010»
15 years 1 months ago
A fast solver for linear systems with displacement structure
We describe a fast solver for linear systems with reconstructible Cauchylike structure, which requires O(rn2 ) floating point operations and O(rn) memory locations, where n is th...
Antonio Arico, Giuseppe Rodriguez
157
Voted
PAMI
2012
13 years 5 months ago
BRIEF: Computing a Local Binary Descriptor Very Fast
Binary descriptors are becoming increasingly popular as a means to compare feature points very fast and while requiring comparatively small amounts of memory. The typical approach...
Michael Calonder, Vincent Lepetit, Mustafa Öz...
163
Voted
PAMI
2012
13 years 5 months ago
Aggregating Local Image Descriptors into Compact Codes
— This paper addresses the problem of large-scale image search. Three constraints have to be taken into account: search accuracy, efficiency, and memory usage. We first present...
Hervé Jégou, Florent Perronnin, Matt...
158
Voted
WWW
2004
ACM
16 years 3 months ago
A smart hill-climbing algorithm for application server configuration
The overwhelming success of the Web as a mechanism for facilitating information retrieval and for conducting business transactions has led to an increase in the deployment of comp...
Bowei Xi, Zhen Liu, Mukund Raghavachari, Cathy H. ...
218
Voted
ICFP
2009
ACM
16 years 3 months ago
Partial memoization of concurrency and communication
Memoization is a well-known optimization technique used to eliminate redundant calls for pure functions. If a call to a function f with argument v yields result r, a subsequent ca...
Lukasz Ziarek, K. C. Sivaramakrishnan, Suresh Jaga...