Sciweavers

251 search results - page 3 / 51
» Polynomial Time Algorithms for Three-Label Point Labeling
Sort
View
62
Voted
TCOM
2008
81views more  TCOM 2008»
14 years 9 months ago
On optimal computation of MPLS label binding for multipoint-to-point connections
Most network operators have considered reducing Label Switched Routers (LSR) label spaces (i.e. the number of labels that can be used) as a means of simplifying management of under...
Fernando Solano, Ramón Fabregat, José...
DCFS
2011
66views more  DCFS 2011»
13 years 9 months ago
Kleene Theorems for Product Systems
We prove Kleene theorems for two subclasses of labelled product systems which are inspired from well-studied subclasses of 1bounded Petri nets. For product T-systems we define a c...
Kamal Lodaya, Madhavan Mukund, Ramchandra Phawade
CORR
2006
Springer
88views Education» more  CORR 2006»
14 years 9 months ago
Polynomial Time Nondimensionalisation of Ordinary Differential Equations via their Lie Point Symmetries
Lie group theory states that knowledge of a m-parameters solvable group of symmetries of a system of ordinary differential equations allows to reduce by m the number of equation. ...
Evelyne Hubert, Alexandre Sedoglavic
81
Voted
FCT
2001
Springer
15 years 2 months ago
Polynomial Time Algorithms for Finding Unordered Tree Patterns with Internal Variables
Many documents such as Web documents or XML files have tree structures. A term tree is an unordered tree pattern consisting of internal variables and tree structures. In order to ...
Takayoshi Shoudai, Tomoyuki Uchida, Tetsuhiro Miya...
DIS
2007
Springer
15 years 1 months ago
Time and Space Efficient Discovery of Maximal Geometric Graphs
A geometric graph is a labeled graph whose vertices are points in the 2D plane with an isomorphism invariant under geometric transformations such as translation, rotation, and scal...
Hiroki Arimura, Takeaki Uno, Shinichi Shimozono