Sciweavers

20441 search results - page 3785 / 4089
» Locally Computable Structures
Sort
View
ICITS
2009
15 years 1 months ago
Free-Start Distinguishing: Combining Two Types of Indistinguishability Amplification
Abstract. The term indistinguishability amplification refers to a setting where a certain construction combines two (or more) cryptographic primitives of the same type to improve t...
Peter Gazi, Ueli Maurer
ICMCS
2009
IEEE
205views Multimedia» more  ICMCS 2009»
15 years 1 months ago
Bregman vantage point trees for efficient nearest Neighbor Queries
Nearest Neighbor (NN) retrieval is a crucial tool of many computer vision tasks. Since the brute-force naive search is too time consuming for most applications, several tailored d...
Frank Nielsen, Paolo Piro, Michel Barlaud
ICRA
2009
IEEE
126views Robotics» more  ICRA 2009»
15 years 1 months ago
Time-bounded lattice for efficient planning in dynamic environments
For vehicles navigating initially unknown cluttered environments, current state-of-the-art planning algorithms are able to plan and re-plan dynamically-feasible paths efficiently a...
Aleksandr Kushleyev, Maxim Likhachev
ICUMT
2009
15 years 1 months ago
Service and Resource Discovery supports over P2P overlays
We describe the main architecture and the design principles of the Service/Resource Discovery System (SRDS), a component of the XtreemOS Operating System. XtreemOS is a Linux exten...
Emanuele Carlini, Massimo Coppola, Patrizio Dazzi,...
ANOR
2010
153views more  ANOR 2010»
15 years 1 months ago
Solving the Rectangular assignment problem and applications
The rectangular assignment problem is a generalization of the linear assignment problem (LAP): one wants to assign a number of persons to a smaller number of jobs, minimizing the ...
J. Bijsterbosch, A. Volgenant
« Prev « First page 3785 / 4089 Last » Next »