11565 search results - page 323 / 2313 » Computing Minimal Mappings |
177
click to vote
IPPS
2006
IEEE
16 years 25 days ago
2006
IEEE
With the increasing importance of energy consumption considerations and new requirements of emerging applications, in-network processing of information gains recognition as a viab...
183
click to vote
CLOUD
2010
ACM
15 years 12 months ago
2010
ACM
Timely and cost-effective processing of large datasets has become a critical ingredient for the success of many academic, government, and industrial organizations. The combination...
203
click to vote
SCP
2008
15 years 6 months ago
2008
Google's MapReduce programming model serves for processing large data sets in a massively parallel manner. We deliver the first rigorous description of the model including it...
180
click to vote
CVPR
2003
IEEE
16 years 8 months ago
2003
IEEE
Recent advancement in 3D digitization techniques have prompted to the need for 3D object retrieval. Our method of comparing 3D objects for retrieval is based on 3D morphing. It co...
180
click to vote
DAC
1996
ACM
15 years 11 months ago
1996
ACM
In this paper, we study the problem of decomposing gates in fanin-unbounded or K-bounded networks such that the K-input LUT mapping solutions computed by a depthoptimal mapper hav...