Sciweavers

1046 search results - page 116 / 210
» Approximation Algorithms for Domination Search
Sort
View
139
Voted
SIGIR
2011
ACM
14 years 6 months ago
Active learning to maximize accuracy vs. effort in interactive information retrieval
We consider an interactive information retrieval task in which the user is interested in finding several to many relevant documents with minimal effort. Given an initial documen...
Aibo Tian, Matthew Lease
ICPR
2008
IEEE
16 years 4 months ago
Motion estimation approach based on dual-tree complex wavelets
The loss of information due to occlusion and other complications has been one of the main bottlenecks in the field of motion estimation. In this paper, we propose a novel motion e...
Changzhu Wu, Hongxiao Wang, Qing Wang
INFOCOM
2005
IEEE
15 years 8 months ago
Power aware routing for sensor databases
— Wireless sensor networks offer the potential to span and monitor large geographical areas inexpensively. Sensor network databases like TinyDB [1] are the dominant architectures...
Chiranjeeb Buragohain, Divyakant Agrawal, Subhash ...
WWW
2009
ACM
16 years 3 months ago
Efficient interactive fuzzy keyword search
Traditional information systems return answers after a user submits a complete query. Users often feel "left in the dark" when they have limited knowledge about the unde...
Shengyue Ji, Guoliang Li, Chen Li, Jianhua Feng
MM
2006
ACM
108views Multimedia» more  MM 2006»
15 years 9 months ago
Video search reranking via information bottleneck principle
We propose a novel and generic video/image reranking algorithm, IB reranking, which reorders results from text-only searches by discovering the salient visual patterns of relevant...
Winston H. Hsu, Lyndon S. Kennedy, Shih-Fu Chang