1857 search results - page 114 / 372 » Minimum Degree Orderings |
145
click to vote
ISSAC
2007
Springer
16 years 20 days ago
2007
Springer
Constructing some regular graph with a given girth, a given degree and the fewest possible vertices is a hard problem. This problem is called the cage graph problem and has some l...
199
click to vote
SEMWEB
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. In the Semantic Web information would be retrieved, processed, combined, shared and reused in the maximum automatic way possible. Obviously, such procedures involve a hig...
148
click to vote
EPIA
2003
Springer
15 years 11 months ago
2003
Springer
This paper presents an incremental and scalable learning algorithm in order to mine numeric, low dimensionality, high–cardinality, time–changing data streams. Within the Superv...
158
click to vote
IV
2002
IEEE
15 years 11 months ago
2002
IEEE
We describe a virtual reality widget library and two medical applications. These applications, built on the widget library, make use of collaborative interaction techniques. These...
147
click to vote
ASIACRYPT
2000
Springer
15 years 11 months ago
2000
Springer
We establish, for the first time, an explicit and simple lower bound on the nonlinearity Nf of a Boolean function f of n variables satisfying the avalanche criterion of degree p, ...