Sciweavers

162 search results - page 18 / 33
» Improved Parameterized Algorithms for the Kemeny Aggregation...
Sort
View
SIGMOD
2011
ACM
219views Database» more  SIGMOD 2011»
12 years 10 months ago
Context-sensitive ranking for document retrieval
We study the problem of context-sensitive ranking for document retrieval, where a context is defined as a sub-collection of documents, and is specified by queries provided by do...
Liang Jeff Chen, Yannis Papakonstantinou
CVPR
2004
IEEE
13 years 11 months ago
Face Localization via Hierarchical CONDENSATION with Fisher Boosting Feature Selection
We formulate face localization as a Maximum A Posteriori Probability(MAP) problem of finding the best estimation of human face configuration in a given image. The a prior distribu...
Jilin Tu, ZhenQiu Zhang, Zhihong Zeng, Thomas S. H...
CDC
2009
IEEE
168views Control Systems» more  CDC 2009»
14 years 7 days ago
Content distribution by multiple multicast trees and intersession cooperation: Optimal algorithms and approximations
—The paper addresses the problem of massive content distribution in the network where multiple sessions coexist. In the traditional approaches, the sessions form separate overlay...
Xiaoying Zheng, Chunglae Cho, Ye Xia
GLOBECOM
2006
IEEE
14 years 1 months ago
Fast Packet Classification using Group Bit Vector
—Packet classification is important in fulfilling the requirements of new services such as policy-based routing in next generation networks. In this paper, we propose a novel bit...
Tong Liu, Huawei Li, Xiaowei Li, Yinhe Han
ICDE
2005
IEEE
108views Database» more  ICDE 2005»
14 years 9 months ago
Range Efficient Computation of F0 over Massive Data Streams
Efficient one-pass computation of F0, the number of distinct elements in a data stream, is a fundamental problem arising in various contexts in databases and networking. We consid...
Pavan Aduri, Srikanta Tirthapura