Sciweavers

12825 search results - page 1885 / 2565
» Improved PLSOM algorithm
Sort
View
199
Voted
STOC
2007
ACM
179views Algorithms» more  STOC 2007»
16 years 7 months ago
Towards 3-query locally decodable codes of subexponential length
A q-query Locally Decodable Code (LDC) encodes an n-bit message x as an N-bit codeword C(x), such that one can probabilistically recover any bit xi of the message by querying only...
Sergey Yekhanin
223
Voted
STOC
2003
ACM
124views Algorithms» more  STOC 2003»
16 years 7 months ago
Extractors: optimal up to constant factors
This paper provides the first explicit construction of extractors which are simultaneously optimal up to constant factors in both seed length and output length. More precisely, fo...
Chi-Jen Lu, Omer Reingold, Salil P. Vadhan, Avi Wi...
294
Voted
VLDB
2007
ACM
131views Database» more  VLDB 2007»
16 years 7 months ago
Dissemination of compressed historical information in sensor networks
Sensor nodes are small devices that "measure" their environment and communicate feeds of low-level data values to a base station for further processing and archiving. Dis...
Antonios Deligiannakis, Yannis Kotidis, Nick Rouss...
303
Voted
SIGMOD
2009
ACM
215views Database» more  SIGMOD 2009»
16 years 7 months ago
Efficient type-ahead search on relational data: a TASTIER approach
Existing keyword-search systems in relational databases require users to submit a complete query to compute answers. Often users feel "left in the dark" when they have l...
Guoliang Li, Shengyue Ji, Chen Li, Jianhua Feng
287
Voted
SIGMOD
2008
ACM
236views Database» more  SIGMOD 2008»
16 years 7 months ago
Approximate embedding-based subsequence matching of time series
A method for approximate subsequence matching is introduced, that significantly improves the efficiency of subsequence matching in large time series data sets under the dynamic ti...
Vassilis Athitsos, Panagiotis Papapetrou, Michalis...
« Prev « First page 1885 / 2565 Last » Next »