Sciweavers

16404 search results - page 806 / 3281
» A set coverage problem
Sort
View
DIS
2009
Springer
16 years 2 months ago
Subspace Discovery for Promotion: A Cell Clustering Approach
The promotion analysis problem has been proposed in [16], where ranking-based promotion query processing techniques are studied to effectively and efficiently promote a given obje...
Tianyi Wu, Jiawei Han
RECSYS
2009
ACM
16 years 2 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
CDC
2008
IEEE
184views Control Systems» more  CDC 2008»
16 years 2 months ago
Almost sure convergence to consensus in Markovian random graphs
— In this paper we discuss the consensus problem for a network of dynamic agents with undirected information flow and random switching topologies. The switching is determined by...
Ion Matei, Nuno C. Martins, John S. Baras
SIBGRAPI
2008
IEEE
16 years 1 months ago
A New Training Algorithm for Pattern Recognition Technique Based on Straight Line Segments
Recently, a new Pattern Recognition technique based on straight line segments (SLSs) was presented. The key issue in this new technique is to find a function based on distances b...
João Henrique Burckas Ribeiro, Ronaldo Fumi...
INFOCOM
2007
IEEE
16 years 1 months ago
A Framework for Tiered Service in MPLS Networks
— Many network operators offer some type of tiered service, in which users may select only from a small set of service levels (tiers). Such a service has the potential to simplif...
George N. Rouskas, Nikhil Baradwaj