Sciweavers

199 search results - page 30 / 40
» On some Algorithmic Problems for Groups and Monoids
Sort
View
SDM
2009
SIAM
205views Data Mining» more  SDM 2009»
14 years 4 months ago
Identifying Information-Rich Subspace Trends in High-Dimensional Data.
Identifying information-rich subsets in high-dimensional spaces and representing them as order revealing patterns (or trends) is an important and challenging research problem in m...
Chandan K. Reddy, Snehal Pokharkar
KDD
2010
ACM
327views Data Mining» more  KDD 2010»
13 years 11 months ago
Cold start link prediction
In the traditional link prediction problem, a snapshot of a social network is used as a starting point to predict, by means of graph-theoretic measures, the links that are likely ...
Vincent Leroy, Berkant Barla Cambazoglu, Francesco...
DEBS
2008
ACM
13 years 9 months ago
Event dissemination via group-aware stream filtering
We consider a distributed system that disseminates highvolume event streams to many simultaneous monitoring applications over a low-bandwidth network. For bandwidth efficiency, we...
Ming Li, David Kotz
IJCV
2006
206views more  IJCV 2006»
13 years 7 months ago
Random Sampling for Subspace Face Recognition
Subspacefacerecognitionoftensuffersfromtwoproblems:(1)thetrainingsamplesetissmallcompared with the high dimensional feature vector; (2) the performance is sensitive to the subspace...
Xiaogang Wang, Xiaoou Tang
APPROX
2007
Springer
112views Algorithms» more  APPROX 2007»
14 years 1 months ago
Encouraging Cooperation in Sharing Supermodular Costs
Abstract Consider a situation where a group of agents wishes to share the costs of their joint actions, and needs to determine how to distribute the costs amongst themselves in a f...
Andreas S. Schulz, Nelson A. Uhan