Sciweavers

3652 search results - page 217 / 731
» A study of query length
Sort
View
CIKM
2009
Springer
14 years 2 months ago
Compressing tags to find interesting media groups
On photo sharing websites like Flickr and Zooomr, users are offered the possibility to assign tags to their uploaded pictures. Using these tags to find interesting groups of sem...
Matthijs van Leeuwen, Francesco Bonchi, Börku...
RTSS
2007
IEEE
14 years 2 months ago
Distributed Minimal Time Convergecast Scheduling for Small or Sparse Data Sources
— Many applications of sensor networks require the base station to collect all the data generated by sensor nodes. As a consequence many-to-one communication pattern, referred to...
Ying Zhang, Shashidhar Gandham, Qingfeng Huang
STACS
2001
Springer
14 years 20 days ago
Approximation Algorithms for the Bottleneck Stretch Factor Problem
The stretch factor of a Euclidean graph is the maximum ratio of the distance in the graph between any two points and their Euclidean distance. Given a set S of n points in Rd, we ...
Giri Narasimhan, Michiel H. M. Smid
DAS
2010
Springer
14 years 8 days ago
Towards more effective distance functions for word image matching
Matching word images has many applications in document recognition and retrieval systems. Dynamic Time Warping (DTW) is popularly used to estimate the similarity between word imag...
Raman Jain, C. V. Jawahar
FUN
2010
Springer
230views Algorithms» more  FUN 2010»
13 years 11 months ago
O(1)-Time Unsorting by Prefix-Reversals in a Boustrophedon Linked List
Conventional wisdom suggests that O(k)-time is required to reverse a substring of length k. To reduce this time complexity, a simple and unorthodox data structure is introduced. A ...
Aaron Williams