4306 search results - page 353 / 862 » Timed Testing with TorX |
169
click to vote
ALGORITHMICA
2011
14 years 10 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...
162
click to vote
ACCV
2010
Springer
14 years 10 months ago
2010
Springer
In this paper, we present an efficient algorithm for 3D object recognition in presence of clutter and occlusions in noisy, sparse and unsegmented range data. The method uses a robu...
159
Voted
COR
2011
14 years 10 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...
148
Voted
CORR
2011
Springer
14 years 10 months ago
2011
Springer
— In recent times, many protocols have been proposed to provide security for various information and communication systems. Such protocols must be tested for their functional cor...
137
click to vote
COLING
2010
14 years 10 months ago
2010
In statistical machine translation, decoding without any reordering constraint is an NP-hard problem. Inversion Transduction Grammars (ITGs) exploit linguistic structure and can w...