Sciweavers

205 search results - page 17 / 41
» Engineering Planar Separator Algorithms
Sort
View
POPL
2007
ACM
16 years 5 months ago
Modular verification of a non-blocking stack
This paper contributes to the development of techniques for the modular proof of programs that include concurrent algorithms. We present a proof of a non-blocking concurrent algor...
Matthew J. Parkinson, Richard Bornat, Peter W. O'H...
TIP
2008
168views more  TIP 2008»
15 years 5 months ago
A Real-Time Algorithm for the Approximation of Level-Set-Based Curve Evolution
Abstract--In this paper, we present a complete and practical algorithm for the approximation of level-set-based curve evolution suitable for real-time implementation. In particular...
Yonggang Shi, William Clement Karl
SOCO
2009
Springer
15 years 11 months ago
Lazy Composition of Representations in Java
Abstract. The separation of concerns has been a core idiom of software engineering for decades. In general, software can be decomposed properly only according to a single concern, ...
Rémi Douence, Xavier Lorca, Nicolas Loriant
171
Voted
WINE
2007
Springer
151views Economy» more  WINE 2007»
15 years 11 months ago
Computing Optimal Bundles for Sponsored Search
A context in sponsored search is additional information about a query, such as the user’s age, gender or location, that can change an advertisement’s relevance or an advertise...
Arpita Ghosh, Hamid Nazerzadeh, Mukund Sundararaja...
ISMIS
2005
Springer
15 years 10 months ago
Identifying Content Blocks from Web Documents
Intelligent information processing systems, such as digital libraries or search engines index web-pages according to their informative content. However, web-pages contain several n...
Sandip Debnath, Prasenjit Mitra, C. Lee Giles