Sciweavers

3913 search results - page 346 / 783
» complexity 2006
Sort
View
JAPLL
2010
104views more  JAPLL 2010»
15 years 5 months ago
Complete axiomatizations for XPath fragments
We provide complete axiomatizations for several fragments of XPath: sets of equivalences from which every other valid equivalence is derivable. Specifically, we axiomatize downwar...
Balder ten Cate, Tadeusz Litak, Maarten Marx
INFORMATICALT
1998
89views more  INFORMATICALT 1998»
15 years 6 months ago
Simply Invertible Matrices and Fast Prediction
Abstract. We study invertibility of big n × n matrices. There exists a number of algorithms, especially in mathematical statistics and numerical mathematics, requiring to invert s...
Valdas Diciunas
165
Voted
JCB
2000
87views more  JCB 2000»
15 years 6 months ago
Comparison of Additive Trees Using Circular Orders
It has been postulated that existing species have been linked in the past in a way that can be described using an additive tree structure. Any such tree structure reflecting speci...
Vladimir Makarenkov, Bruno Leclerc
MP
2002
84views more  MP 2002»
15 years 6 months ago
The volume algorithm revisited: relation with bundle methods
We revise the Volume Algorithm (VA) for linear programming and relate it to bundle methods. When first introduced, VA was presented as a subgradient-like method for solving the ori...
Laura Bahiense, Nelson Maculan, Claudia A. Sagasti...
DATE
2006
IEEE
171views Hardware» more  DATE 2006»
16 years 24 days ago
4G applications, architectures, design methodology and tools for MPSoC
transistors the design of the SoC needs to be moved to a higher level of abstraction. We need to think in processors and interconnects rather than gates and wires. We discuss the n...