4047 search results - page 602 / 810 » The Discrete Basis Problem |
145
click to vote
DAC
2010
ACM
15 years 8 months ago
2010
ACM
—Discrete gate sizing is one of the most commonly used, flexible, and powerful techniques for digital circuit optimization. The underlying problem has been proven to be NP-hard ...
176
click to vote
PODC
2010
ACM
15 years 8 months ago
2010
ACM
An edge dominating set for a graph G is a set D of edges such that each edge of G is in D or adjacent to at least one edge in D. This work studies deterministic distributed approx...
128
click to vote
ECCV
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. We propose a homography estimation method from the contours of planar regions. Standard projective invariants such as cross ratios or canonical frames based on hot points...
151
click to vote
FINTAL
2006
15 years 8 months ago
2006
Naive Bayes classifier is a frequently used method in various natural language processing tasks. Inspired by a modified version of the method called the flexible Bayes classifier, ...
117
click to vote
WG
2000
Springer
15 years 8 months ago
2000
Springer
: In a previous work, the authors introduced the class of graphs with bounded induced distance of order k, (BID(k) for short) to model non-reliable interconnection networks. A netw...