Sciweavers

511 search results - page 72 / 103
» Approximate Selection Queries over Imprecise Data
Sort
View
SAC
2005
ACM
15 years 11 months ago
LighTS: a lightweight, customizable tuple space supporting context-aware applications
The tuple space model inspired by Linda has recently been rediscovered by distributed middleware. Moreover, some researchers also applied it in the challenging scenarios involving...
Gian Pietro Picco, Davide Balzarotti, Paolo Costa
TCSV
2008
195views more  TCSV 2008»
15 years 6 months ago
Locality Versus Globality: Query-Driven Localized Linear Models for Facial Image Computing
Conventional subspace learning or recent feature extraction methods consider globality as the key criterion to design discriminative algorithms for image classification. We demonst...
Yun Fu, Zhu Li, Junsong Yuan, Ying Wu, Thomas S. H...
PVLDB
2010
122views more  PVLDB 2010»
15 years 4 months ago
On Graph Query Optimization in Large Networks
The dramatic proliferation of sophisticated networks has resulted in a growing need for supporting effective querying and mining methods over such large-scale graph-structured da...
Peixiang Zhao, Jiawei Han
183
Voted
ICDE
2007
IEEE
174views Database» more  ICDE 2007»
16 years 11 days ago
Adapting Partitioned Continuous Query Processing in Distributed Systems
Partitioned query processing is an effective method to process continuous queries with large stateful operators in a distributed systems. This method typically partitions input da...
Yali Zhu, Elke A. Rundensteiner
DASFAA
2008
IEEE
105views Database» more  DASFAA 2008»
16 years 16 days ago
Redundant Array of Inexpensive Nodes for DWS
The DWS (Data Warehouse Striping) technique is a round-robin data partitioning approach especially designed for distributed data warehousing environments. In DWS the fact tables ar...
Jorge Vieira, Marco Vieira, Marco Costa, Henrique ...