Sciweavers

2523 search results - page 121 / 505
» Objective: In Minimum Context
Sort
View
DAM
2007
74views more  DAM 2007»
15 years 4 months ago
On the uniform edge-partition of a tree
We study the problem of uniformly partitioning the edge set of a tree with n edges into k connected components, where k ≤ n. The objective is to minimize the ratio of the maximu...
Bang Ye Wu, Hung-Lung Wang, Shih Ta Kuan, Kun-Mao ...
JGAA
2006
63views more  JGAA 2006»
15 years 4 months ago
A Factor-Two Approximation Algorithm for Two-Dimensional Phase Unwrapping
Two-dimensional phase unwrapping is the problem of deducing unambiguous "phase" from values known only modulo 2. Many authors agree that the objective of phase unwrappin...
Reuven Bar-Yehuda, Irad Yavneh
ML
2012
ACM
385views Machine Learning» more  ML 2012»
13 years 11 months ago
An alternative view of variational Bayes and asymptotic approximations of free energy
Bayesian learning, widely used in many applied data-modeling problems, is often accomplished with approximation schemes because it requires intractable computation of the posterio...
Kazuho Watanabe
EMNLP
2006
15 years 5 months ago
Fully Automatic Lexicon Expansion for Domain-oriented Sentiment Analysis
This paper proposes an unsupervised lexicon building method for the detection of polar clauses, which convey positive or negative aspects in a specific domain. The lexical entries...
Hiroshi Kanayama, Tetsuya Nasukawa
WICON
2010
15 years 1 months ago
Distributed Management of Contextual Affinities in Context-aware Systems
In context-aware computing, distributed information about entities, such as people, places and objects, is captured and made available to applications, which utilize this context....
Robert Schmohl, Uwe Baumgarten