Sciweavers

3267 search results - page 385 / 654
» Generalized quasirandom graphs
Sort
View
WADS
2009
Springer
243views Algorithms» more  WADS 2009»
16 years 1 months ago
Approximation Algorithms for Buy-at-Bulk Geometric Network Design
Abstract. The buy-at-bulk network design problem has been extensively studied in the general graph model. In this paper we consider the geometric version of the problem, where all ...
Artur Czumaj, Jurek Czyzowicz, Leszek Gasieniec, J...
RECSYS
2009
ACM
16 years 1 months ago
Recommendations with prerequisites
We consider the problem of recommending the best set of k items when there is an inherent ordering between items, expressed as a set of prerequisites (e.g., the course ‘Real Ana...
Aditya G. Parameswaran, Hector Garcia-Molina
156
Voted
WCNC
2008
IEEE
16 years 1 months ago
Cooperative Transmission in a Wireless Cluster Based on Flow Management
—In this paper, a cooperative transmission design for a multi-node wireless cluster network is presented. It is assumed that the nodes operate in half-duplex mode and that channe...
Debdeep Chatterjee, Tan F. Wong, Tat M. Lok
ICDAR
2007
IEEE
16 years 1 months ago
A Shared Parts Model for Document Image Recognition
We address document image classification by visual appearance. An image is represented by a variable-length list of visually salient features. A hierarchical Bayesian network is ...
M. Das Gupta, P. Sarkar
CCS
2007
ACM
16 years 26 days ago
Analyzing the vulnerability of superpeer networks against attack
In this paper, we develop an analytical framework to measure the vulnerability of superpeer networks against attack. Two different kinds of attacks namely deterministic and degre...
Bivas Mitra, Fernando Peruani, Sujoy Ghose, Niloy ...