Sciweavers

264 search results - page 35 / 53
» First order LUB approximations: characterization and algorit...
Sort
View
ISLPED
1997
ACM
114views Hardware» more  ISLPED 1997»
15 years 3 months ago
Cycle-accurate macro-models for RT-level power analysis
 In this paper we present a methodology and techniques for generating cycle-accurate macro-models for RTlevel power analysis. The proposed macro-model predicts not only...
Qinru Qiu, Qing Wu, Massoud Pedram, Chih-Shun Ding
ISAAC
2003
Springer
133views Algorithms» more  ISAAC 2003»
15 years 4 months ago
The Intractability of Computing the Hamming Distance
Given a string x and a language L, the Hamming distance of x to L is the minimum Hamming distance of x to any string in L. The edit distance of a string to a language is analogous...
Bodo Manthey, Rüdiger Reischuk
ICCV
2007
IEEE
16 years 1 months ago
Fast Bilinear SfM with Side Information
We study the beneficial effect of side information on the Structure from Motion (SfM) estimation problem. The side information that we consider is measurement of a `reference vect...
Mahesh Ramachandran, Ashok Veeraraghavan, Rama Che...
SIGMOD
2007
ACM
181views Database» more  SIGMOD 2007»
15 years 12 months ago
Progressive and selective merge: computing top-k with ad-hoc ranking functions
The family of threshold algorithm (i.e., TA) has been widely studied for efficiently computing top-k queries. TA uses a sort-merge framework that assumes data lists are pre-sorted...
Dong Xin, Jiawei Han, Kevin Chen-Chuan Chang
ICALP
2009
Springer
15 years 12 months ago
Elimination Graphs
A graph is chordal if it does not contain any induced cycle of size greater than three. An alternative characterization of chordal graphs is via a perfect elimination ordering, whi...
Yuli Ye, Allan Borodin