Sciweavers

6939 search results - page 1129 / 1388
» Algorithm Engineering for Parallel Computation
Sort
View
PODC
2010
ACM
15 years 8 months ago
Eventually linearizable shared objects
Linearizability is the strongest known consistency property of shared objects. In asynchronous message passing systems, Linearizability can be achieved with 3S and a majority of c...
Marco Serafini, Dan Dobre, Matthias Majuntke, P&ea...
CVPR
2008
IEEE
16 years 6 months ago
A fast local descriptor for dense matching
We introduce a novel local image descriptor designed for dense wide-baseline matching purposes. We feed our descriptors to a graph-cuts based dense depth map estimation algorithm ...
Engin Tola, Vincent Lepetit, Pascal Fua
CAV
2007
Springer
112views Hardware» more  CAV 2007»
15 years 10 months ago
Magnifying-Lens Abstraction for Markov Decision Processes
ng-Lens Abstraction for Markov Decision Processes⋆ In Proc. of CAV 2007: 19th International Conference on Computer-Aided Verification, Lectures Notes in Computer Science. c Spri...
Luca de Alfaro, Pritam Roy
WWW
2008
ACM
16 years 4 months ago
Improving relevance judgment of web search results with image excerpts
Current web search engines return result pages containing mostly text summary even though the matched web pages may contain informative pictures. A text excerpt (i.e. snippet) is ...
Zhiwei Li, Shuming Shi, Lei Zhang
GECCO
2007
Springer
181views Optimization» more  GECCO 2007»
15 years 10 months ago
ACOhg: dealing with huge graphs
Ant Colony Optimization (ACO) has been successfully applied to those combinatorial optimization problems which can be translated into a graph exploration. Artificial ants build s...
Enrique Alba, J. Francisco Chicano
« Prev « First page 1129 / 1388 Last » Next »