Sciweavers

2192 search results - page 364 / 439
» Algorithms for Challenging Motif Problems
Sort
View
PERCOM
2011
ACM
12 years 12 months ago
Mobile node rostering in intermittently connected passive RFID networks
— This paper focuses on the problem of rostering in intermittently connected passive RFID networks. It aims to report a list of tagged mobile nodes that appear in given intereste...
Zhipeng Yang, Hongyi Wu
SIGMOD
2012
ACM
242views Database» more  SIGMOD 2012»
11 years 10 months ago
Dynamic management of resources and workloads for RDBMS in cloud: a control-theoretic approach
As cloud computing environments become explosively popular, dealing with unpredictable changes, uncertainties, and disturbances in both systems and environments turns out to be on...
Pengcheng Xiong
ICDE
2012
IEEE
216views Database» more  ICDE 2012»
11 years 10 months ago
Load Balancing in MapReduce Based on Scalable Cardinality Estimates
—MapReduce has emerged as a popular tool for distributed and scalable processing of massive data sets and is increasingly being used in e-science applications. Unfortunately, the...
Benjamin Gufler, Nikolaus Augsten, Angelika Reiser...
KDD
2012
ACM
263views Data Mining» more  KDD 2012»
11 years 10 months ago
Integrating community matching and outlier detection for mining evolutionary community outliers
Temporal datasets, in which data evolves continuously, exist in a wide variety of applications, and identifying anomalous or outlying objects from temporal datasets is an importan...
Manish Gupta, Jing Gao, Yizhou Sun, Jiawei Han
CVPR
2005
IEEE
14 years 10 months ago
Shape Matching and Object Recognition Using Low Distortion Correspondences
We approach recognition in the framework of deformable shape matching, relying on a new algorithm for finding correspondences between feature points. This algorithm sets up corres...
Alexander C. Berg, Tamara L. Berg, Jitendra Malik