Sciweavers

2635 search results - page 381 / 527
» Algorithms for the Database Layout Problem
Sort
View
EDBT
2012
ACM
228views Database» more  EDBT 2012»
13 years 7 months ago
Finding maximal k-edge-connected subgraphs from a large graph
In this paper, we study how to find maximal k-edge-connected subgraphs from a large graph. k-edge-connected subgraphs can be used to capture closely related vertices, and findin...
Rui Zhou, Chengfei Liu, Jeffrey Xu Yu, Weifa Liang...
KDD
2008
ACM
142views Data Mining» more  KDD 2008»
16 years 4 months ago
Efficient ticket routing by resolution sequence mining
IT problem management calls for quick identification of resolvers to reported problems. The efficiency of this process highly depends on ticket routing--transferring problem ticke...
Qihong Shao, Yi Chen, Shu Tao, Xifeng Yan, Nikos A...
CVPR
2008
IEEE
16 years 6 months ago
Regression from patch-kernel
In this paper, we present a patch-based regression framework for addressing the human age and head pose estimation problems. Firstly, each image is encoded as an ensemble of order...
Shuicheng Yan, Xi Zhou, Ming Liu, Mark Hasegawa-Jo...
ECCV
2002
Springer
16 years 6 months ago
All the Images of an Outdoor Scene
The appearance of an outdoor scene depends on a variety of factors such as viewing geometry, scene structure and reflectance (BRDF or BTF), illumination (sun, moon, stars, street l...
Srinivasa G. Narasimhan, Chi Wang, Shree K. Nayar
ICDE
2009
IEEE
170views Database» more  ICDE 2009»
16 years 6 months ago
Semantics of Ranking Queries for Probabilistic Data and Expected Ranks
Abstract-- When dealing with massive quantities of data, topk queries are a powerful technique for returning only the k most relevant tuples for inspection, based on a scoring func...
Graham Cormode, Feifei Li, Ke Yi