Sciweavers

39 search results - page 3 / 8
» Plottable Real Number Functions and the Computable Graph The...
Sort
View
TPHOL
2005
IEEE
13 years 11 months ago
A HOL Theory of Euclidean Space
We describe a formalization of the elementary algebra, topology and analysis of finite-dimensional Euclidean space in the HOL Light theorem prover. (Euclidean space is RN with the...
John Harrison
LICS
1996
IEEE
13 years 10 months ago
Integration in Real PCF
Real PCF is an extension of the programming language PCF with a data type for real numbers. Although a Real PCF definable real number cannot be computed in finitely many steps, it...
Abbas Edalat, Martín Hötzel Escard&oac...
IPPS
2005
IEEE
13 years 11 months ago
Optimal Channel Assignments for Lattices with Conditions at Distance Two
The problem of radio channel assignments with multiple levels of interference can be modeled using graph theory. Given a graph G, possibly infinite, and real numbers k1, k2, . . ...
Jerrold R. Griggs, Xiaohua Teresa Jin
ICDM
2006
IEEE
134views Data Mining» more  ICDM 2006»
13 years 11 months ago
Fast Frequent Free Tree Mining in Graph Databases
Free tree, as a special graph which is connected, undirected and acyclic, is extensively used in domains such as computational biology, pattern recognition, computer networks, XML...
Peixiang Zhao, Jeffrey Xu Yu
DAM
2011
13 years 23 days ago
Weak sense of direction labelings and graph embeddings
An edge-labeling λ for a directed graph G has a weak sense of direction (WSD) if there is a function f that satisfies the condition that for any node u and for any two label seq...
Christine T. Cheng, Ichiro Suzuki