Sciweavers

5331 search results - page 837 / 1067
» Algebraic Methods for Optimization Problems
Sort
View
101
Voted
OTM
2007
Springer
15 years 8 months ago
Self-healing in Binomial Graph Networks
The number of processors embedded in high performance computing platforms is growing daily to solve larger and more complex problems. However, as the number of components increases...
Thara Angskun, George Bosilca, Jack Dongarra
123
Voted
PKDD
2007
Springer
109views Data Mining» more  PKDD 2007»
15 years 8 months ago
Matching Partitions over Time to Reliably Capture Local Clusters in Noisy Domains
Abstract. When seeking for small clusters it is very intricate to distinguish between incidental agglomeration of noisy points and true local patterns. We present the PAMALOC algor...
Frank Höppner, Mirko Böttcher
124
Voted
VMCAI
2007
Springer
15 years 8 months ago
Constraint Solving for Interpolation
Interpolation is an important component of recent methods for program verification. It provides a natural and effective means for computing separation between the sets of ‘good...
Andrey Rybalchenko, Viorica Sofronie-Stokkermans
ACCV
2006
Springer
15 years 8 months ago
Super Resolution Using Graph-Cut
Abstract. This paper addresses the problem of super resolution - obtaining a single high-resolution image given a set of low resolution images which are related by small displaceme...
Uma Mudenagudi, Ram Singla, Prem Kumar Kalra, Subh...
145
Voted
ADMA
2006
Springer
220views Data Mining» more  ADMA 2006»
15 years 8 months ago
Mining and Validation of Localized Frequent Web Access Patterns with Dynamic Tolerance
Mining user profiles is a crucial task for Web usage mining, and can be accomplished by mining frequent patterns. However, in the Web usage domain, sessions tend to be very sparse,...
Olfa Nasraoui, Suchandra Goswami