Sciweavers

102 search results - page 5 / 21
» On two problems concerning end extensions
Sort
View
ACS
2000
13 years 7 months ago
Free Adjunction of Morphisms
Abstract. We develop a general setting for the treatment of extensions of categories by means of freely adjoined morphisms. To this end, we study what we call composition graphs, i...
Lutz Schröder, Horst Herrlich
ICRA
2008
IEEE
197views Robotics» more  ICRA 2008»
14 years 1 months ago
A Bayesian framework for optimal motion planning with uncertainty
— Modeling robot motion planning with uncertainty in a Bayesian framework leads to a computationally intractable stochastic control problem. We seek hypotheses that can justify a...
Andrea Censi, Daniele Calisi, Alessandro De Luca, ...
NOLISP
2005
Springer
14 years 1 months ago
The COST-277 Speech Database
Databases are fundamental for research investigations. This paper presents the speech database generated in the framework of COST-277 “Nonlinear speech processing” European pro...
Marcos Faúndez-Zanuy, Martin Hagmüller...
INFOCOM
2007
IEEE
14 years 1 months ago
The Cache Inference Problem and its Application to Content and Request Routing
— In many networked applications, independent caching agents cooperate by servicing each other’s miss streams, without revealing the operational details of the caching mechanis...
Nikolaos Laoutaris, Georgios Zervas, Azer Bestavro...
JNCA
2011
102views more  JNCA 2011»
12 years 10 months ago
Multi-objective zone mapping in large-scale distributed virtual environments
In large-scale distributed virtual environments (DVEs), the NP-hard zone mapping problem concerns how to assign distinct zones of the virtual world to a number of distributed serv...
Ta Nguyen Binh Duong, Suiping Zhou, Wentong Cai, X...