Sciweavers

6266 search results - page 100 / 1254
» New results on the computability and complexity of points - ...
Sort
View
JC
1998
65views more  JC 1998»
13 years 8 months ago
Monte Carlo Complexity of Global Solution of Integral Equations
The problem of global solution of Fredholm integral equations is studied. This means that one seeks to approximate the full solution function (as opposed to the local problem, whe...
Stefan Heinrich
DSN
2007
IEEE
14 years 3 months ago
How to Choose a Timing Model?
When employing a consensus algorithm for state machine replication, should one optimize for the case that all communication links are usually timely, or for fewer timely links? Do...
Idit Keidar, Alexander Shraer
CVPR
2009
IEEE
14 years 3 months ago
A distribution-based approach to tracking points in velocity vector fields
We address the problem of tracking points in dense vector fields. Such vector fields may come from computational fluid dynamics simulations, environmental monitoring sensors, o...
Liefei Xu, H. Quynh Dinh, Eugene Zhang, Zhongzang ...
GCC
2003
Springer
14 years 2 months ago
Computing Pool: A Simplified and Practical Computational Grid Model
Even though grid research is prosperous in an extensive context, few grid platforms for high performance computing are practical and in operation so far. Since most applications a...
Peng Liu, Yao Shi, Sanli Li
ICCV
2003
IEEE
14 years 11 months ago
Space-time Interest Points
Local image features or interest points provide compact ract representations of patterns in an image. In this paper, we propose to extend the notion of spatial interest points int...
Ivan Laptev, Tony Lindeberg