145 search results - page 12 / 29 » A new characterization of HH-free graphs |
155
click to vote
DMCS
2003
15 years 7 months ago
2003
d Abstract) Anah´ı Gajardo† GI2MA, Departamento de Ingenier´ıa Matem´atica, Universidad de Concepci´on, Casilla 160-C, correo 3, Concepci´on, Chile The Langton’s ant is ...
156
click to vote
DATE
2003
IEEE
15 years 11 months ago
2003
IEEE
A new method is presented to model symbolically strongly nonlinear circuits, characterized by Piece-Wise Linear (PWL) functions. The method follows the idea of Bokhoven and Leenae...
166
click to vote
APWEB
2005
Springer
15 years 11 months ago
2005
Springer
This paper presents a new method for visualizing and navigating huge graphs. The main feature of this method is that it applies Level-Of-Detail (LOD) strategy to graph visualizati...
170
click to vote
INFOCOM
2008
IEEE
16 years 14 days ago
2008
IEEE
In this paper, we characterize the performance of an important class of scheduling schemes, called Greedy Maximal Scheduling (GMS), for multi-hop wireless networks. While a lower ...
171
click to vote
WEBI
2005
Springer
15 years 11 months ago
2005
Springer
This work presents a new perspective on characterizing the similarity between elements of a database or, more generally, nodes of a weighted, undirected, graph. It is based on a M...