Sciweavers

701 search results - page 116 / 141
» Costs Are Expensive!
Sort
View
ICCV
2009
IEEE
16 years 4 months ago
Efficient subset selection based on the Renyi entropy
Many machine learning algorithms require the summation of Gaussian kernel functions, an expensive operation if implemented straightforwardly. Several methods have been proposed t...
Vlad I. Morariu1, Balaji V. Srinivasan, Vikas C. R...
ICDE
2008
IEEE
149views Database» more  ICDE 2008»
16 years 12 days ago
Sharoes: A Data Sharing Platform for Outsourced Enterprise Storage Environments
Abstract-- With fast paced growth of digital data and exploding storage management costs, enterprises are looking for new ways to effectively manage their data. One such cost-effec...
Aameek Singh, Ling Liu
ICDE
2007
IEEE
175views Database» more  ICDE 2007»
16 years 12 days ago
Dynamic Batch Nearest Neighbor Search in Video Retrieval
To retrieve similar database videos to a query clip, each video is typically represented by a sequence of highdimensional feature vectors. Given a query video containing m feature...
Jie Shao, Zi Huang, Heng Tao Shen, Xiaofang Zhou, ...
81
Voted
DAC
2006
ACM
16 years 14 hour ago
Timing-driven Steiner trees are (practically) free
Traditionally, rectilinear Steiner minimum trees (RSMT) are widely used for routing estimation in design optimizations like floorplanning and physical synthesis. Since it optimize...
Charles J. Alpert, Andrew B. Kahng, Cliff C. N. Sz...
SIGSOFT
2006
ACM
15 years 11 months ago
Dynamic slicing long running programs through execution fast forwarding
Fixing runtime bugs in long running programs using trace based analyses such as dynamic slicing was believed to be prohibitively expensive. In this paper, we present a novel execu...
Xiangyu Zhang, Sriraman Tallam, Rajiv Gupta