4171 search results - page 740 / 835 » Choice numbers of graphs |
170
click to vote
GEOS
2007
Springer
16 years 1 months ago
2007
Springer
In geospatial applications with heterogeneous classification schemes that describe related domains, an ontology-driven approach to data sharing and interoperability relies on the ...
189
click to vote
HPCC
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. CAN is a famous structured peer-to-peer network based on ddimensional torus topology with constant degree and logarithmical diameter, but suffers from poor scalability wh...
150
click to vote
ICALP
2007
Springer
16 years 1 months ago
2007
Springer
Register allocation is NP-complete in general but can be solved in linear time for straight-line programs where each variable has at most one definition point if the bank of regis...
171
click to vote
MFCS
2007
Springer
16 years 1 months ago
2007
Springer
Consider a rooted directed acyclic graph G = (V, E) with root r, representing a collection V of web pages connected via a set E of hyperlinks. Each node v is associated with the pr...
163
click to vote
PEPM
2007
ACM
16 years 1 months ago
2007
ACM
A logic program strongly quasi-terminates when only a finite number of distinct atoms (modulo variable renaming) are derivable from any given query and computation rule. This noti...