Sciweavers

3019 search results - page 65 / 604
» Approximating the Domatic Number
Sort
View
DASFAA
2008
IEEE
150views Database» more  DASFAA 2008»
15 years 11 months ago
Approximate Clustering of Time Series Using Compact Model-Based Descriptions
Clustering time series is usually limited by the fact that the length of the time series has a significantly negative influence on the runtime. On the other hand, approximative c...
Hans-Peter Kriegel, Peer Kröger, Alexey Pryak...
128
Voted
ICALP
2007
Springer
15 years 10 months ago
Private Multiparty Sampling and Approximation of Vector Combinations
We consider the problem of private efficient data mining of vertically-partitioned databases. Each of several parties holds a column of a data matrix (a vector) and the parties wan...
Yuval Ishai, Tal Malkin, Martin J. Strauss, Rebecc...
130
Voted
AAIM
2010
Springer
181views Algorithms» more  AAIM 2010»
15 years 7 months ago
Efficient Exact and Approximate Algorithms for the Complement of Maximal Strip Recovery
Given two genomic maps G and H represented by a sequence of n gene markers, a strip (syntenic block) is a sequence of distinct markers of length at least two which appear as subseq...
Binhai Zhu
ALGOSENSORS
2008
Springer
15 years 6 months ago
Target Counting under Minimal Sensing: Complexity and Approximations
We consider the problem of counting a set of discrete point targets using a network of sensors under a minimalistic model. Each sensor outputs a single integer, the number of disti...
Sorabh Gandhi, Rajesh Kumar 0003, Subhash Suri
162
Voted
DC
2008
15 years 4 months ago
Approximate distributed top- k queries
We consider a distributed system where each node keeps a local count for items (similar to elections where nodes are ballot boxes and items are candidates). A top-k query in such ...
Boaz Patt-Shamir, Allon Shafrir