Sciweavers

745 search results - page 125 / 149
» The origins of combinatorics on words
Sort
View
RECOMB
2001
Springer
15 years 10 months ago
Finding motifs using random projections
motif discovery problem abstracts the task of discovering short, conserved sites in genomic DNA. Pevzner and Sze recently described a precise combinatorial formulation of motif di...
Jeremy Buhler, Martin Tompa
STOC
2006
ACM
152views Algorithms» more  STOC 2006»
15 years 10 months ago
Private approximation of search problems
Many approximation algorithms have been presented in the last decades for hard search problems. The focus of this paper is on cryptographic applications, where it is desired to de...
Amos Beimel, Paz Carmi, Kobbi Nissim, Enav Weinreb
VLDB
2008
ACM
110views Database» more  VLDB 2008»
15 years 10 months ago
Enhancing histograms by tree-like bucket indices
Histograms are used to summarize the contents of relations into a number of buckets for the estimation of query result sizes. Several techniques (e.g., MaxDiff and V-Optimal) have ...
Francesco Buccafurri, Gianluca Lax, Domenico SaccÃ...
SIGMOD
2006
ACM
138views Database» more  SIGMOD 2006»
15 years 10 months ago
Context-sensitive ranking
The original PageRank algorithm for improving the ranking of search-query results computes a single vector, using the link structure of the Web, to capture the relative "impor...
Rakesh Agrawal, Ralf Rantzau, Evimaria Terzi
EWSN
2007
Springer
15 years 9 months ago
RIDA: A Robust Information-Driven Data Compression Architecture for Irregular Wireless Sensor Networks
Abstract. In this paper, we propose and evaluate RIDA, a novel informationdriven architecture for distributed data compression in a sensor network, allowing it to conserve energy a...
Xuan Thanh Dang, Nirupama Bulusu, Wu-chi Feng