Sciweavers

1038 search results - page 205 / 208
» Code Compression
Sort
View
KDD
2005
ACM
165views Data Mining» more  KDD 2005»
14 years 10 months ago
Co-clustering by block value decomposition
Dyadic data matrices, such as co-occurrence matrix, rating matrix, and proximity matrix, arise frequently in various important applications. A fundamental problem in dyadic data a...
Bo Long, Zhongfei (Mark) Zhang, Philip S. Yu
CIKM
2008
Springer
13 years 11 months ago
TinyLex: static n-gram index pruning with perfect recall
Inverted indexes using sequences of characters (n-grams) as terms provide an error-resilient and language-independent way to query for arbitrary substrings and perform approximate...
Derrick Coetzee
SPAA
2010
ACM
13 years 10 months ago
On the bit communication complexity of randomized rumor spreading
We study the communication complexity of rumor spreading in the random phone-call model. Suppose n players communicate in parallel rounds, where in each round every player calls a...
Pierre Fraigniaud, George Giakkoupis
TIP
2011
116views more  TIP 2011»
13 years 4 months ago
Interactive Streaming of Stored Multiview Video Using Redundant Frame Structures
—While much of multiview video coding focuses on the rate-distortion performance of compressing all frames of all views for storage or non-interactive video delivery over network...
Gene Cheung, Antonio Ortega, Ngai-Man Cheung
CADE
2001
Springer
14 years 10 months ago
More On Implicit Syntax
Proof assistants based on type theories, such as Coq and Lego, allow users to omit subterms on input that can be inferred automatically. While those mechanisms are well known, ad-h...
Marko Luther