11565 search results - page 241 / 2313 » Computing Minimal Mappings |
174
click to vote
TKDE
2012
13 years 7 months ago
2012
Feature selection is fundamental to knowledge discovery from massive amount of high-dimensional data. In an effort to establish theoretical justification for feature selection al...
140
click to vote
CG
2004
Springer
15 years 4 months ago
2004
Springer
nd maps are powerful abstractions. Their combination, Hierarchical Graph Maps, provide effective tools to process a graph that is too large to fit on the screen. They provide hier...
167
click to vote
Publication
Surface reconstruction from gradient fields is an important
final step in several applications involving gradient manipulations
and estimation. Typically, the resulting gradient
...
152
click to vote
ICALP
2009
Springer
16 years 5 months ago
2009
Springer
In this paper we extend the study of flow-energy scheduling to a model that allows both sleep management and speed scaling. Our main result is a sleep management algorithm called I...
243
click to vote
SIGMOD
2009
ACM
16 years 5 months ago
2009
ACM
Existing work in the skyline literature focuses on optimizing the processing cost. This paper aims at minimization of the communication overhead in client-server architectures, wh...