Sciweavers

440 search results - page 18 / 88
» Decision making in very large networks
Sort
View
CVPR
2008
IEEE
14 years 10 months ago
Manifold learning using robust Graph Laplacian for interactive image search
Interactive image search or relevance feedback is the process which helps a user refining his query and finding difficult target categories. This consists in partially labeling a ...
Hichem Sahbi, Patrick Etyngier, Jean-Yves Audibert...
ICASSP
2008
IEEE
14 years 3 months ago
Graph laplacian for interactive image retrieval
Interactive image search or relevance feedback is the process which helps a user refining his query and finding difficult target categories. This consists in a step-by-step lab...
Hichem Sahbi, Patrick Etyngier, Jean-Yves Audibert...
ICN
2007
Springer
14 years 2 months ago
Heuristic Approach of Optimal Code Allocation in High Speed Downlink Packet Access Networks
— In this paper, we use the Markov Decision Process (MDP) technique to find the optimal code allocation policy in High-Speed Downlink Packet Access (HSDPA) networks. A discrete ...
Hussein Al-Zubaidy, Jerome Talim, Ioannis Lambadar...
ICC
2007
IEEE
14 years 3 months ago
A Cost-Effective Approach to Optical Packet/burst Scheduling
Abstract— Optical Burst and Packet Switching are being considered as the most promising paradigms to increase bandwidth efficiency in IP over DWDM networks. In both cases, due t...
Franco Callegati, Aldo Campi, Walter Cerroni
IOR
2011
175views more  IOR 2011»
13 years 3 months ago
Clique Relaxations in Social Network Analysis: The Maximum k-Plex Problem
This paper introduces and studies the maximum k-plex problem, which arises in social network analysis and has wider applicability in several important areas employing graph-based ...
Balabhaskar Balasundaram, Sergiy Butenko, Illya V....