Sciweavers

16404 search results - page 193 / 3281
» A set coverage problem
Sort
View
132
Voted
ECCV
2004
Springer
16 years 5 months ago
Sparse Finite Elements for Geodesic Contours with Level-Sets
Level-set methods have been shown to be an effective way to solve optimisation problems that involve closed curves. They are well known for their capacity to deal with flexible top...
Martin Weber, Andrew Blake, Roberto Cipolla
HICSS
2008
IEEE
118views Biometrics» more  HICSS 2008»
15 years 10 months ago
Guidelines for Setting Organizational Policies for Data Quality
: From a process perspective, the tasks that individuals carry out within an organization are linked. These linkages are often documented as process flow diagrams that connect the ...
Rajiv M. Dewan, Veda C. Storey
122
Voted
MFCS
2004
Springer
15 years 9 months ago
Scaled Dimension and the Kolmogorov Complexity of Turing-Hard Sets
We study constructive and resource-bounded scaled dimension as an information content measure and obtain several results that parallel previous work on unscaled dimension. Scaled ...
John M. Hitchcock, María López-Vald&...
COLT
2001
Springer
15 years 8 months ago
Tracking a Small Set of Experts by Mixing Past Posteriors
In this paper, we examine on-line learning problems in which the target concept is allowed to change over time. In each trial a master algorithm receives predictions from a large ...
Olivier Bousquet, Manfred K. Warmuth
ECAI
2006
Springer
15 years 7 months ago
Coalition Structure Generation in Task-Based Settings
The coalition formation process, in which a number of independent, autonomous agents come together to act as a collective, is an important form of interaction in multi-agent system...
Viet Dung Dang, Nicholas R. Jennings