Sciweavers

739 search results - page 117 / 148
» Sorting Algorithms
Sort
View
ALGORITHMICA
1999
112views more  ALGORITHMICA 1999»
13 years 7 months ago
Suffix Trees on Words
We discuss an intrinsic generalization of the suffix tree, designed to index a string of length n which has a natural partitioning into m multicharacter substrings or words. This ...
Arne Andersson, N. Jesper Larsson, Kurt Swanson
JAISE
2010
182views Algorithms» more  JAISE 2010»
13 years 2 months ago
Exploring semantics in activity recognition using context lattices
Studying human activities has significant implication in human beneficial applications such as personal healthcare. This research has been facilitated by the development of sensor ...
Juan Ye, Simon Dobson
JMLR
2010
134views more  JMLR 2010»
13 years 2 months ago
Using Contextual Representations to Efficiently Learn Context-Free Languages
We present a polynomial update time algorithm for the inductive inference of a large class of context-free languages using the paradigm of positive data and a membership oracle. W...
Alexander Clark, Rémi Eyraud, Amaury Habrar...
CIDR
2011
228views Algorithms» more  CIDR 2011»
12 years 11 months ago
Crowdsourced Databases: Query Processing with People
Amazon’s Mechanical Turk (“MTurk”) service allows users to post short tasks (“HITs”) that other users can receive a small amount of money for completing. Common tasks on...
Adam Marcus 0002, Eugene Wu 0002, Samuel Madden, R...
SIGMOD
2012
ACM
246views Database» more  SIGMOD 2012»
11 years 10 months ago
Skimmer: rapid scrolling of relational query results
A relational database often yields a large set of tuples as the result of a query. Users browse this result set to find the information they require. If the result set is large, ...
Manish Singh, Arnab Nandi, H. V. Jagadish