721 search results - page 19 / 145 » Almost universal graphs |
85
Voted
GI
2004
Springer
15 years 6 months ago
2004
Springer
: A concept for identification of candidates for outliers is presented, with a focus on nominal variables. The database concerned is searched for rules that are almost universally...
116
Voted
COMBINATORICS
2002
15 years 16 days ago
2002
We present a simple heuristic for finding a small connected dominating set of cubic graphs. The average-case performance of this heuristic, which is a randomised greedy algorithm,...
138
click to vote
ECCC
2007
15 years 20 days ago
2007
We study graph properties which are testable for bounded degree graphs in time independent of the input size. Our goal is to distinguish between graphs having a predetermined grap...
125
Voted
ALT
2005
Springer
15 years 9 months ago
2005
Springer
This paper shows how universal learning can be achieved with expert advice. To this aim, we specify an experts algorithm with the following characteristics: (a) it uses only feedba...
114
Voted
PERVASIVE
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. Mobile phones are increasingly becoming ubiquitous computational devices that are almost always available, individually adaptable, and nearly universally connectable (usi...