Sciweavers

1369 search results - page 162 / 274
» Lattice computations for random numbers
Sort
View
GBRPR
2007
Springer
14 years 3 months ago
Grouping Using Factor Graphs: An Approach for Finding Text with a Camera Phone
Abstract. We introduce a new framework for feature grouping based on factor graphs, which are graphical models that encode interactions among arbitrary numbers of random variables....
Huiying Shen, James Coughlan
ICDM
2006
IEEE
183views Data Mining» more  ICDM 2006»
14 years 3 months ago
Accelerating Newton Optimization for Log-Linear Models through Feature Redundancy
— Log-linear models are widely used for labeling feature vectors and graphical models, typically to estimate robust conditional distributions in presence of a large number of pot...
Arpit Mathur, Soumen Chakrabarti
WIOPT
2006
IEEE
14 years 3 months ago
Achievable performance improvements provided by cooperative diversity
— This paper examines the achievable performance gains when a particular class of cooperative relaying known as best-select is employed. In essence, best-select seeks to improve ...
Stephan Bohacek
EUROPAR
2005
Springer
14 years 2 months ago
Dynamic Page Migration Under Brownian Motion
We consider Dynamic Page Migration (DPM) problem, one of the fundamental subproblems of data management in dynamically changing networks. We investigate a hybrid scenario, where ac...
Marcin Bienkowski, Miroslaw Korzeniowski
FCT
2005
Springer
14 years 2 months ago
Reconstructing Many Partitions Using Spectral Techniques
A partitioning of a set of n items is a grouping of these items into k disjoint, equally sized classes. Any partition can be modeled as a graph. The items become the vertices of th...
Joachim Giesen, Dieter Mitsche