Sciweavers

653 search results - page 27 / 131
» The size of minimum 3-trees
Sort
View
IJON
2008
173views more  IJON 2008»
14 years 11 months ago
Support vector machine classification for large data sets via minimum enclosing ball clustering
Support vector machine (SVM) is a powerful technique for data classification. Despite of its good theoretic foundations and high classification accuracy, normal SVM is not suitabl...
Jair Cervantes, Xiaoou Li, Wen Yu, Kang Li
VLSID
2003
IEEE
103views VLSI» more  VLSID 2003»
16 years 5 days ago
Minimum Dynamic Power CMOS Circuit Design by a Reduced Constraint Set Linear Program
In the previous work, the problem of nding gate delays to eliminate glitches has been solved by linear programs (LP) requiring an exponentially large number ofconstraints. By intr...
Tezaswi Raja, Vishwani D. Agrawal, Michael L. Bush...
CVPR
2010
IEEE
15 years 8 months ago
The Cluttered Background Problem for Active Contours: A Minimum-Latency Solution
We present a region-based active contour detection algorithm for objects that exhibit relatively homogeneous photometric characteristics (e.g. smooth color or gray levels), embedd...
Stefano Soatto, Ganesh Sundaramoorthi, Anthony Yez...
FCT
2009
Springer
15 years 6 months ago
Competitive Group Testing and Learning Hidden Vertex Covers with Minimum Adaptivity
Suppose that we are given a set of n elements d of which are “defective”. A group test can check for any subset, called a pool, whether it contains a defective. It is well know...
Peter Damaschke, Azam Sheikh Muhammad
GC
2002
Springer
14 years 11 months ago
The Hilbert Series of the Face Ring of a Flag Complex
It is shown that the Hilbert series of the face ring of a clique complex (equivalently, flag complex) of a graph G is, up to a factor, just a specialization of SG (x, y), the subg...
Paul Renteln