Sciweavers

4850 search results - page 747 / 970
» Approximate Data Structures with Applications
Sort
View
PKDD
2009
Springer
118views Data Mining» more  PKDD 2009»
15 years 11 months ago
The Feature Importance Ranking Measure
Most accurate predictions are typically obtained by learning machines with complex feature spaces (as e.g. induced by kernels). Unfortunately, such decision rules are hardly access...
Alexander Zien, Nicole Krämer, Sören Son...
PVM
2009
Springer
15 years 11 months ago
Processing MPI Datatypes Outside MPI
The MPI datatype functionality provides a powerful tool for describing structured memory and file regions in parallel applications, enabling noncontiguous data to be operated on b...
Robert B. Ross, Robert Latham, William Gropp, Ewin...
SCALESPACE
2009
Springer
15 years 11 months ago
A Variational Model for Interactive Shape Prior Segmentation and Real-Time Tracking
In this paper, we introduce a semi-automated segmentation method based on minimizing the Geodesic Active Contour energy incorporating a shape prior. We increase the robustness of t...
Manuel Werlberger, Thomas Pock, Markus Unger, Hors...
ACMSE
2009
ACM
15 years 11 months ago
A hybrid approach to mining frequent sequential patterns
The mining of frequent sequential patterns has been a hot and well studied area—under the broad umbrella of research known as KDD (Knowledge Discovery and Data Mining)— for we...
Erich Allen Peterson, Peiyi Tang
DOCENG
2009
ACM
15 years 11 months ago
Declarative interfaces for dynamic widgets communications
Widgets are small and focused multimedia applications that can be found on desktop computers, mobile devices or even TV sets. Widgets rely on structured documents to describe thei...
Cyril Concolato, Jean Le Feuvre, Jean-Claude Dufou...