Sciweavers

ML
2010
ACM
151views Machine Learning» more  ML 2010»
13 years 3 months ago
Inductive transfer for learning Bayesian networks
In several domains it is common to have data from different, but closely related problems. For instance, in manufacturing, many products follow the same industrial process but with...
Roger Luis, Luis Enrique Sucar, Eduardo F. Morales
DAS
2010
Springer
13 years 3 months ago
Automatic unsupervised parameter selection for character segmentation
A major difficulty for designing a document image segmentation methodology is the proper value selection for all involved parameters. This is usually done after experimentations o...
Georgios Vamvakas, Nikolaos Stamatopoulos, Basilio...
PVLDB
2008
118views more  PVLDB 2008»
13 years 4 months ago
Efficient top-k processing over query-dependent functions
We study the efficient evaluation of top-k queries over data items, where the score of each item is dynamically computed by applying an item-specific function whose parameter valu...
Lin Guo, Sihem Amer-Yahia, Raghu Ramakrishnan, Jay...
IVC
2007
72views more  IVC 2007»
13 years 4 months ago
A sensitivity analysis method and its application in physics-based nonrigid motion modeling
Parameters used in physical models for nonrigid and articulated motion analysis are often not known with high precision. It has been recognized that commonly used assumptions abou...
Yong Zhang, Dmitry B. Goldgof, Sudeep Sarkar, Leon...
TCS
2002
13 years 4 months ago
Words and forbidden factors
Given a
Filippo Mignosi, Antonio Restivo, Marinella Sciort...
SIGPRO
2002
92views more  SIGPRO 2002»
13 years 4 months ago
A unified method for optimizing linear image restoration filters
Image restoration from degraded images lies at the foundation of image processing, pattern recognition, and computer vision, so it has been extensively studied. A large number of ...
Masashi Sugiyama, Hidemitsu Ogawa
SIGIR
2002
ACM
13 years 4 months ago
Two-stage language models for information retrieval
The optimal settings of retrieval parameters often depend on both the document collection and the query, and are usually found through empirical tuning. In this paper, we propose ...
ChengXiang Zhai, John D. Lafferty
MOC
2002
71views more  MOC 2002»
13 years 4 months ago
Efficient lattice assessment for LCG and GLP parameter searches
Abstract. In the present paper we show how to speed up lattice parameter searches for Monte Carlo and quasi
Karl Entacher, Thomas Schell, Andreas Uhl
COMBINATORICS
2004
112views more  COMBINATORICS 2004»
13 years 4 months ago
On a Combinatorial Problem of Asmus Schmidt
For any integer r 2, define a sequence of numbers {c (r) k }k=0,1,..., independent of the parameter n, by n k=0 n k r n + k k r = n k=0 n k n + k k c (r) k , n = 0, 1, 2, . . . ....
W. Zudilin
TSP
2008
101views more  TSP 2008»
13 years 4 months ago
Subspace-Based Algorithm for Parameter Estimation of Polynomial Phase Signals
In this correspondence, parameter estimation of a polynomial phase signal (PPS) in additive white Gaussian noise is addressed. Assuming that the order of the PPS is at least 3, the...
Yuntao Wu, Hing Cheung So, Hongqing Liu