2016 search results - page 155 / 404 » Megamaps: Construction and Examples |
227
Voted
WADS
2007
Springer
16 years 1 months ago
2007
Springer
A ball graph is an intersection graph of a set of balls with arbitrary radii. Given a real number t > 1, we say that a subgraph G′ of a graph G is a t-spanner of G, if for eve...
191
click to vote
CADE
2002
Springer
16 years 7 months ago
2002
Springer
We show that a conjunctive normal form (CNF) formula F is unsatisfiable iff there is a set of points of the Boolean space that is stable with respect to F. So testing the satisfiab...
195
click to vote
DCC
2006
IEEE
16 years 6 months ago
2006
IEEE
An uncovering-by-bases for a group G acting on a finite set is a set U of bases for G such that any r-subset of is disjoint from at least one base in U, where r is a parameter d...
198
click to vote
IJCNN
2007
IEEE
16 years 1 months ago
2007
IEEE
— Using the classical Parzen window estimate as the target function, the kernel density estimation is formulated as a regression problem and the orthogonal forward regression tec...
224
Voted
RTA
2005
Springer
16 years 15 days ago
2005
Springer
We present a new method for proving termination of term rewriting systems automatically. It is a generalization of the match bound method for string rewriting. To prove that a term...