Sciweavers

1403 search results - page 170 / 281
» Set cover algorithms for very large datasets
Sort
View
157
Voted
CLUSTER
2009
IEEE
16 years 27 days ago
Combining I/O operations for multiple array variables in parallel netCDF
—Parallel netCDF (PnetCDF) is a popular library used in many scientific applications to store scientific datasets. It provides high-performance parallel I/O while maintaining ...
Kui Gao, Wei-keng Liao, Alok N. Choudhary, Robert ...
KIVS
2005
Springer
15 years 11 months ago
Ranked Matching for Service Descriptions Using OWL-S
Abstract. Semantic Web services envision the automated discovery and selection of Web services. This can be realised by adding semantic information to advertised services and servi...
Michael C. Jaeger, Gregor Rojec-Goldmann, Christop...
ICMI
2004
Springer
152views Biometrics» more  ICMI 2004»
15 years 11 months ago
Exploiting prosodic structuring of coverbal gesticulation
Although gesture recognition has been studied extensively, communicative, affective, and biometrical “utility” of natural gesticulation remains relatively unexplored. One of t...
Sanshzar Kettebekov
DATE
2006
IEEE
128views Hardware» more  DATE 2006»
15 years 9 months ago
Platform-based design of wireless sensor networks for industrial applications
We present a methodology, an environment and supporting tools to map an application on a wireless sensor network (WSN). While the method is quite general, we use extensively an exa...
Alvise Bonivento, Luca P. Carloni, Alberto L. Sang...
SISAP
2011
IEEE
437views Data Mining» more  SISAP 2011»
14 years 9 months ago
Succinct nearest neighbor search
In this paper we present a novel technique for nearest neighbor searching dubbed neighborhood approximation. The central idea is to divide the database into compact regions repres...
Eric Sadit Tellez, Edgar Chávez, Gonzalo Na...