Sciweavers

1963 search results - page 130 / 393
» Function Materialization in Object Bases
Sort
View
SIGSOFT
2007
ACM
16 years 4 months ago
Measuring empirical computational complexity
The standard language for describing the asymptotic behavior of algorithms is theoretical computational complexity. We propose a method for describing the asymptotic behavior of p...
Simon Goldsmith, Alex Aiken, Daniel Shawcross Wilk...
ICIP
2002
IEEE
16 years 5 months ago
Joint space-time image sequence segmentation based on volume competition and level sets
In this paper, we address the issue of joint space-time segmentation of image sequences. Typical approaches to such segmentation consider two image frames at a time, and perform t...
Mirko Ristivojevic, Janusz Konrad
EDBTW
2004
Springer
15 years 8 months ago
Clustering Structured Web Sources: A Schema-Based, Model-Differentiation Approach
Abstract. The Web has been rapidly “deepened” with the prevalence of databases online. On this “deep Web,” numerous sources are structured, providing schema-rich data– Th...
Bin He, Tao Tao, Kevin Chen-Chuan Chang
DSVIS
1994
Springer
15 years 6 months ago
A Model-Based Approach to Presentation: A Continuum from Task Analysis to Prototype
This paper presents a complete model-based approach to the building of presentation for a business oriented highly interactive application. This approach is considered complete in...
François Bodart, Anne-Marie Hennebert, Isab...
COLT
2000
Springer
15 years 7 months ago
Barrier Boosting
Boosting algorithms like AdaBoost and Arc-GV are iterative strategies to minimize a constrained objective function, equivalent to Barrier algorithms. Based on this new understandi...
Gunnar Rätsch, Manfred K. Warmuth, Sebastian ...