Sciweavers

3122 search results - page 135 / 625
» A Theory of Network Equivalence
Sort
View
ICC
2007
IEEE
137views Communications» more  ICC 2007»
16 years 23 days ago
Maximum-Likelihood Decoding and Performance Analysis of a Noisy Channel Network with Network Coding
Abstract— We investigate sink decoding methods and performance analysis approaches for a network with intermediate node encoding (coded network). The network consists of statisti...
Ming Xiao, Tor M. Aulin
AAECC
2006
Springer
74views Algorithms» more  AAECC 2006»
16 years 12 days ago
Nested Codes for Constrained Memory and for Dirty Paper
Abstract Dirty paper coding are relevant for wireless networks, multiuser channels, and digital watermarking. We show that the problem of dirty paper is essentially equivalent to s...
Hans Georg Schaathun, Gérard D. Cohen
WWW
2009
ACM
16 years 7 months ago
Query clustering using click-through graph
In this paper we describe a problem of discovering query clusters from a click-through graph of web search logs. The graph consists of a set of web search queries, a set of pages ...
Jeonghee Yi, Farzin Maghoul
KDD
2007
ACM
165views Data Mining» more  KDD 2007»
16 years 6 months ago
Stochastic processes and temporal data mining
This article tries to give an answer to a fundamental question in temporal data mining: "Under what conditions a temporal rule extracted from up-to-date temporal data keeps i...
Paul Cotofrei, Kilian Stoffel
TLCA
2009
Springer
16 years 29 days ago
Lexicographic Path Induction
Abstract. Programming languages theory is full of problems that reduce to proving the consistency of a logic, such as the normalization of typed lambda-calculi, the decidability of...
Jeffrey Sarnat, Carsten Schürmann