Sciweavers

1985 search results - page 377 / 397
» A Minimal Periods Algorithm with Applications
Sort
View
CORR
2007
Springer
90views Education» more  CORR 2007»
15 years 3 months ago
Discrete Denoising with Shifts
We introduce S-DUDE, a new algorithm for denoising Discrete Memoryless Channel (DMC)-corrupted data. The algorithm, which generalizes the recently introduced DUDE (Discrete Univer...
Taesup Moon, Tsachy Weissman
PAMI
2006
230views more  PAMI 2006»
15 years 3 months ago
Shape Registration in Implicit Spaces Using Information Theory and Free Form Deformations
We present a novel variational and statistical approach for shape registration. Shapes of interest are implicitly embedded in a higher dimensional space of distance transforms. In...
Xiaolei Huang, Nikos Paragios, Dimitris N. Metaxas
TWC
2008
141views more  TWC 2008»
15 years 3 months ago
Progressive Accumulative Routing: Fundamental Concepts and Protocol
This paper considers a multi-hop network in which relay nodes cooperate to minimize the total energy consumed in transmitting a (unicast) packet from a source to a destination. We...
Raymond Yim, Neelesh B. Mehta, Andreas F. Molisch,...
JACM
2010
137views more  JACM 2010»
15 years 1 months ago
Reconciling description logics and rules
Description logics (DLs) and rules are formalisms that emphasize different aspects of knowledge representation: whereas DLs are focused on specifying and reasoning about conceptual...
Boris Motik, Riccardo Rosati
EDBT
2011
ACM
197views Database» more  EDBT 2011»
14 years 6 months ago
Symmetrizations for clustering directed graphs
Graph clustering has generally concerned itself with clustering undirected graphs; however the graphs from a number of important domains are essentially directed, e.g. networks of...
Venu Satuluri, Srinivasan Parthasarathy