Sciweavers

1640 search results - page 80 / 328
» Conditional Independence Trees
Sort
View
242
Voted
ICDE
1997
IEEE
130views Database» more  ICDE 1997»
16 years 4 months ago
High-Dimensional Similarity Joins
Many emerging data mining applications require a similarity join between points in a high-dimensional domain. We present a new algorithm that utilizes a new index structure, calle...
Kyuseok Shim, Ramakrishnan Srikant, Rakesh Agrawal
ICIP
2008
IEEE
15 years 9 months ago
Multi-view video streaming over P2P networks with low start-up delay
We propose to stream multi-view video over a multi-tree peerto-peer (P2P) network using the NUEPMuT protocol. Each view of the multi-view video is streamed over an independent P2P...
Engin Kurutepe, Thomas Sikora
JCT
2008
103views more  JCT 2008»
15 years 3 months ago
A bijective proof of Jackson's formula for the number of factorizations of a cycle
Factorizations of the cyclic permutation (1 2 . . . N) into two permutations with respectively n and m cycles, or, equivalently, unicellular bicolored maps with N edges and n whit...
Gilles Schaeffer, Ekaterina A. Vassilieva
127
Voted
SIGECOM
2009
ACM
109views ECommerce» more  SIGECOM 2009»
15 years 10 months ago
A new perspective on implementation by voting trees
Voting trees describe an iterative procedure for selecting a single vertex from a tournament. vide a very general abstract model of decision-making among a group of individuals, a...
Felix A. Fischer, Ariel D. Procaccia, Alex Samorod...
135
Voted
CTRSA
2009
Springer
128views Cryptology» more  CTRSA 2009»
15 years 10 months ago
Short Redactable Signatures Using Random Trees
Abstract. A redactable signature scheme for a string of objects supports verification even if multiple substrings are removed from the original string. It is important that the re...
Ee-Chien Chang, Chee Liang Lim, Jia Xu