Sciweavers

2018 search results - page 185 / 404
» Magnitude-preserving ranking algorithms
Sort
View
CIKM
2011
Springer
14 years 6 months ago
S3K: seeking statement-supporting top-K witnesses
Traditional information retrieval techniques based on keyword search help to identify a ranked set of relevant documents, which often contains many documents in the top ranks that...
Steffen Metzger, Shady Elbassuoni, Katja Hose, Ral...
ECCV
2002
Springer
16 years 8 months ago
Structure from Planar Motions with Small Baselines
We study the multi-frame structure from motion problem when the camera translates on a plane with small baselines and arbitrary rotations. This case shows up in many practical appl...
John Oliensis, René Vidal
ICC
2009
IEEE
150views Communications» more  ICC 2009»
15 years 4 months ago
Efficient Resource Discovery in Mobile Ad Hoc Networks
Abstract--The highly dynamic nature of infrastructureless adhoc networks poses new challenges during resource discovery. In this paper, we propose a novel algorithm for resource di...
Ravi Thanawala, Jie Wu, Avinash Srinivasan
CATS
2008
15 years 8 months ago
Generating Balanced Parentheses and Binary Trees by Prefix Shifts
We show that the set Bn of balanced parenthesis strings with n left and n right parentheses can be generated by prefix shifts. If b1, b2, . . . , b2n is a member of Bn, then the k...
Frank Ruskey, Aaron Williams
SODA
2012
ACM
249views Algorithms» more  SODA 2012»
13 years 8 months ago
Improved competitive ratio for the matroid secretary problem
The Matroid Secretary Problem, introduced by Babaioff et al. (2007), is a generalization of the Classical Secretary Problem. In this problem, elements from a matroid are presente...
Sourav Chakraborty, Oded Lachish