Sciweavers

81 search results - page 13 / 17
» A Shortest Learning Path Selection Algorithm in E-learning
Sort
View
TWC
2008
135views more  TWC 2008»
13 years 7 months ago
Optimal Distributed Stochastic Routing Algorithms for Wireless Multihop Networks
A novel framework was introduced recently for stochastic routing in wireless multihop networks, whereby each node selects a neighbor to forward a packet according to a probability...
Alejandro Ribeiro, Nikolas D. Sidiropoulos, Georgi...
CVPR
2005
IEEE
14 years 9 months ago
WaldBoost - Learning for Time Constrained Sequential Detection
: In many computer vision classification problems, both the error and time characterizes the quality of a decision. We show that such problems can be formalized in the framework of...
Jan Sochman, Jiri Matas
CRYPTO
2007
Springer
132views Cryptology» more  CRYPTO 2007»
14 years 1 months ago
How Should We Solve Search Problems Privately?
Abstract. Secure multiparty computation allows a group of distrusting parties to jointly compute a (possibly randomized) function of their inputs. However, it is often the case tha...
Amos Beimel, Tal Malkin, Kobbi Nissim, Enav Weinre...
COMCOM
2006
80views more  COMCOM 2006»
13 years 7 months ago
The prediction-based routing in optical transport networks
In optical networks, the traditional routing problem is generally decoupled into two subproblems, the route selection and the wavelength assignment. Usual RWA (Routing and Wavelen...
Eva Marín-Tordera, Xavier Masip-Bruin, Serg...
WWW
2004
ACM
14 years 8 months ago
Dynamic assembly of learning objects
This paper describes one solution to the problem of how to select sequence, and link Web resources into a coherent, focused organization for instruction that addresses a user'...
Robert G. Farrell, Soyini D. Liburd, John C. Thoma...