Sciweavers

868 search results - page 9 / 174
» Finding Most Likely Solutions
Sort
View
DCC
2005
IEEE
14 years 7 months ago
Efficient Alphabet Partitioning Algorithms for Low-Complexity Entropy Coding
We analyze the technique for reducing the complexity of entropy coding consisting in the a priori grouping of the source alphabet symbols, and in dividing the coding process in tw...
Amir Said
ICWSM
2010
13 years 9 months ago
Who Acquires Friends Through Social Media and Why? "Rich Get Richer" Versus "Seek and Ye Shall Find"
There is an ongoing debate, not just among academics but in popular culture, about whether social media can expand people's social networks, and whether online friends can be...
Zeynep Tufekci
W2GIS
2004
Springer
14 years 29 days ago
Expansion-Based Algorithms for Finding Single Pair Shortest Path on Surface
Abstract. Finding single pair shortest paths on surface is a fundamental problem in various domains, like Geographic Information Systems (GIS) 3D applications, robotic path plannin...
Ke Deng, Xiaofang Zhou
CVPR
2007
IEEE
14 years 9 months ago
On Constant Focal Length Self-Calibration From Multiple Views
We investigate the problem of finding the metric structure of a general 3D scene viewed by a moving camera with square pixels and constant unknown focal length. While the problem ...
Adrien Bartoli, Alain Crouzil, Benoît Bocqui...
ICPR
2006
IEEE
14 years 8 months ago
Finding Text in Natural Scenes by Figure-Ground Segmentation
Much past research on finding text in natural scenes uses bottom-up grouping processes to detect candidate text features as a first processing step. While such grouping procedures...
Huiying Shen, James Coughlan