Sciweavers

953 search results - page 169 / 191
» Using Clustering and Blade Clusters in the Terabyte Task
Sort
View
MICAI
2005
Springer
14 years 27 days ago
Proximity Searching in High Dimensional Spaces with a Proximity Preserving Order
Abstract. Kernel based methods (such as k-nearest neighbors classifiers) for AI tasks translate the classification problem into a proximity search problem, in a space that is usu...
Edgar Chávez, Karina Figueroa, Gonzalo Nava...
CCGRID
2003
IEEE
14 years 22 days ago
Multi-class Applications for Parallel Usage of a Guaranteed Rate and a Scavenger Service
— Grid computing requires network services beyond what is currently provided by the Best-Effort Internet. Among the different approaches towards network Quality of Service, aggre...
Markus Fidler, Volker Sander
COSIT
2003
Springer
145views GIS» more  COSIT 2003»
14 years 19 days ago
Extracting Landmarks with Data Mining Methods
Abstract. The navigation task is a very demanding application for mobile users. The algorithms of present software solutions are based on the established methods of car navigation ...
Birgit Elias
ISCAS
1999
IEEE
128views Hardware» more  ISCAS 1999»
13 years 11 months ago
Dynamic scheduling of multiple video objects for MPEG-4 encoding with user interactions
MPEG-4 video consists of various video objects, rather than frames, allowing a true interactivity and manipulation of separate arbitrary shape object. Soware-based encoding of MPE...
Yong He, Ishfaq Ahmad, Ming L. Liou
ICDCS
1997
IEEE
13 years 11 months ago
Predictable Network Computing
Clusters of networked, off-the-shelf workstations are currently used for computationintensive, parallel applications. However, it is hardly possible to predict the timing behaviou...
Andreas Polze, Gerhard Fohler, Matthias Werner