2432 search results - page 217 / 487 » Degrees and choice numbers |
168
click to vote
COMGEO
2007
ACM
15 years 6 months ago
2007
ACM
Snap rounding is a method for converting arbitrary-precision arrangements of segments into fixed-precision representation. We present an algorithm for snap rounding with running ...
195
click to vote
JCP
2008
15 years 6 months ago
2008
Existing frequent subgraph mining algorithms can operate efficiently on graphs that are sparse, have vertices with low and bounded degrees, and contain welllabeled vertices and edg...
168
click to vote
CPC
2007
15 years 6 months ago
2007
We study a dynamically evolving random graph which adds vertices and edges using preferential attachment and is “attacked by an adversary”. At time t, we add a new vertex xt a...
155
click to vote
PAA
2008
15 years 6 months ago
2008
This paper proposes a method of finding a discriminative linear transformation that enhances the data's degree of conformance to the compactness hypothesis and its inverse. Th...
166
click to vote
AUTOMATICA
2005
15 years 6 months ago
2005
This paper studies a method for the identification of Hammerstein models based on Least Squares Support Vector Machines (LS-SVMs). The technique allows for the determination of th...