Sciweavers

3360 search results - page 207 / 672
» Opportunistic Data Structures with Applications
Sort
View
AVI
2006
15 years 5 months ago
Implicit brushing and target snapping: data exploration and sense-making on large displays
During grouping tasks for data exploration and sense-making, the criteria are normally not well-defined. When users are bringing together data objects thought to be similar in som...
Xiaohua Sun, Patrick Chiu, Jeffrey Huang, Maribeth...
INFOCOM
2012
IEEE
13 years 6 months ago
On the construction of data aggregation tree with minimum energy cost in wireless sensor networks: NP-completeness and approxima
—In many applications, it is a basic operation for the sink to periodically collect reports from all sensors. Since the data gathering process usually proceeds for many rounds, i...
Tung-Wei Kuo, Ming-Jer Tsai
SSDBM
2003
IEEE
95views Database» more  SSDBM 2003»
15 years 9 months ago
A Quad-Tree Based Multiresolution Approach for Two-dimensional Summary Data
In many application contexts, like statistical databases, scientific databases, query optimizers, OLAP, and so on, data are often summarized into synopses of aggregate values. Su...
Francesco Buccafurri, Filippo Furfaro, Domenico Sa...
IC
2004
15 years 5 months ago
Accurate Web Service Composition Using Global Data Schema
The emergence of Web Service has led to more research into Web Services composition. It has received much interest to support business-to-business or enterprise application integra...
Shoujian Yu, Chao Yang, Jiajin Le
CVPR
2005
IEEE
16 years 6 months ago
Robust L1 Norm Factorization in the Presence of Outliers and Missing Data by Alternative Convex Programming
Matrix factorization has many applications in computer vision. Singular Value Decomposition (SVD) is the standard algorithm for factorization. When there are outliers and missing ...
Qifa Ke, Takeo Kanade