Sciweavers

194 search results - page 19 / 39
» Performance aspects of dynamic re-allocation for partitioned...
Sort
View
IPPS
2006
IEEE
14 years 1 months ago
An extensible global address space framework with decoupled task and data abstractions
ions Sriram Krishnamoorthy½ Umit Catalyurek¾ Jarek Nieplocha¿ Atanas Rountev½ P. Sadayappan½ ½ Dept. of Computer Science and Engineering, ¾ Dept. of Biomedical Informatics T...
Sriram Krishnamoorthy, Ümit V. Çataly&...
ICWN
2008
13 years 8 months ago
Progressive Content-Sensitive Data Retrieval in Sensor Networks
: Problem statement: For a sensor network comprising autonomous and self-organizing data sources, efficient similarity-based search for semantic-rich resources (such as video data)...
Bo Yang, Mareboyana Manohar, Shaoying Kou
KDD
2007
ACM
249views Data Mining» more  KDD 2007»
14 years 7 months ago
The minimum consistent subset cover problem and its applications in data mining
In this paper, we introduce and study the Minimum Consistent Subset Cover (MCSC) problem. Given a finite ground set X and a constraint t, find the minimum number of consistent sub...
Byron J. Gao, Martin Ester, Jin-yi Cai, Oliver Sch...
ICRA
1999
IEEE
90views Robotics» more  ICRA 1999»
13 years 11 months ago
Testing and Analysis of a Flexible Feeding System
Flexible parts feeding techniques have recently begun to gain industry acceptance. However, one barrier to effective flexible feeding solutions is a dearth of knowledge of the und...
Greg C. Causey, Roger D. Quinn, Michael S. Branick...
FAST
2004
13 years 8 months ago
Diamond: A Storage Architecture for Early Discard in Interactive Search
This paper explores the concept of early discard for interactive search of unindexed data. Processing data inside storage devices using downloaded searchlet code enables Diamond t...
Larry Huston, Rahul Sukthankar, Rajiv Wickremesing...