Sciweavers

2173 search results - page 18 / 435
» On the Values of Reducibility Candidates
Sort
View
EDBT
2010
ACM
155views Database» more  EDBT 2010»
14 years 1 months ago
Reducing metadata complexity for faster table summarization
Since the visualization real estate puts stringent constraints on how much data can be presented to the users at once, table summarization is an essential tool in helping users qu...
K. Selçuk Candan, Mario Cataldi, Maria Luis...
MOBIHOC
2003
ACM
14 years 7 months ago
Energy-efficient caching strategies in ad hoc wireless networks
In this paper, we address the problem of energy-conscious cache placement in wireless ad hoc networks. We consider a network comprising a server with an interface to the wired net...
Pavan Nuggehalli, Vikram Srinivasan, Carla-Fabiana...
CGO
2004
IEEE
13 years 11 months ago
A Compiler Scheme for Reusing Intermediate Computation Results
Recent research has shown that programs often exhibit value locality. Such locality occurs when a code segment, although executed repeatedly in the program, takes only a small num...
Yonghua Ding, Zhiyuan Li
PERCOM
2010
ACM
13 years 5 months ago
Faster Bayesian context inference by using dynamic value ranges
—This paper shows how to reduce evaluation time for context inference. Probabilistic Context Inference has proven to be a good representation of the physical reality with uncerta...
Korbinian Frank, Patrick Robertson, Sergio Fortes ...
IPCV
2008
13 years 8 months ago
Face Recognition using PCA and LDA with Singular Value Decomposition (SVD)
Linear Discriminant Analysis(LDA) is well-known scheme for feature extraction and dimension reduction. It has been used widely in many applications involving high-dimensional data,...
Neeta Nain, Nitish Agarwal, Prashant Gour, Rakesh ...