1000 search results - page 63 / 200 » order 2011 |
110
click to vote
CVPR
2011
IEEE
14 years 7 months ago
2011
IEEE
Object recognition has made great strides recently. However, the best methods, such as those based on kernelSVMs are highly computationally intensive. The problem of how to accele...
108
click to vote
AI
2011
Springer
14 years 7 months ago
2011
Springer
In this paper we present a general framework for the comparison of intervals when preference relations have to established. The use of intervals in order to take into account impr...
135
click to vote
ALGORITHMICA
2011
14 years 7 months ago
2011
We consider the problem of computing efficient strategies for searching in trees. As a generalization of the classical binary search for ordered lists, suppose one wishes to find...
101
click to vote
CMA
2011
14 years 6 months ago
2011
Recently, Parida and Gupta [J. Comp. Appl. Math. 206 (2007), 873-877] used Rall’s recurrence relations approach (from 1961) to approximate roots of nonlinear equations, by develo...
124
click to vote
COR
2011
14 years 6 months ago
2011
We develop a decomposition method for the Time-Constrained Project Scheduling Problem (TCPSP) with Adjacent Resources. For adjacent resources the resource units are ordered and th...