Sciweavers

1871 search results - page 171 / 375
» The Ephemeral Pairing Problem
Sort
View
PAMI
2007
131views more  PAMI 2007»
15 years 6 months ago
Photo-Consistent Reconstruction of Semitransparent Scenes by Density-Sheet Decomposition
—This paper considers the problem of reconstructing visually realistic 3D models of dynamic semitransparent scenes, such as fire, from a very small set of simultaneous views (eve...
Samuel W. Hasinoff, Kiriakos N. Kutulakos
FUIN
2010
89views more  FUIN 2010»
15 years 5 months ago
Computing Maximal Error-detecting Capabilities and Distances of Regular Languages
Abstract. A (combinatorial) channel consists of pairs of words representing all possible inputoutput channel situations. In a past paper, we formalized the intuitive concept of “...
Stavros Konstantinidis, Pedro V. Silva
IFIPTCS
2010
15 years 4 months ago
Deterministic Computations in Time-Varying Graphs: Broadcasting under Unstructured Mobility
Most highly dynamic infrastructure-less networks have in common that the assumption of connectivity does not necessarily hold at a given instant. Still, communication routes can be...
Arnaud Casteigts, Paola Flocchini, Bernard Mans, N...
WAW
2010
Springer
270views Algorithms» more  WAW 2010»
15 years 4 months ago
Fast Katz and Commuters: Efficient Estimation of Social Relatedness in Large Networks
Abstract. Motivated by social network data mining problems such as link prediction and collaborative filtering, significant research effort has been devoted to computing topologica...
Pooya Esfandiar, Francesco Bonchi, David F. Gleich...
226
Voted
ICASSP
2011
IEEE
14 years 10 months ago
Source localization using time difference of arrival within a sparse representation framework
The problem addressed is source localization via time-differenceof-arrival estimation in a multipath channel. Solving this localization problem typically implies cross-correlating...
Ciprian R. Comsa, Alexander M. Haimovich, Stuart C...