Sciweavers

5100 search results - page 566 / 1020
» The Linear Complexity of a Graph
Sort
View
WEBDB
2005
Springer
97views Database» more  WEBDB 2005»
16 years 9 days ago
Towards a Query Language for Multihierarchical XML: Revisiting XPath
In recent years it has been argued that when XML encodings become complex, DOM trees are no longer adequate for query processing. Alternative representations of XML documents, suc...
Ionut Emil Iacob, Alex Dekhtyar
ECAI
2004
Springer
16 years 7 days ago
Tractability Results for Automatic Contracting
Abstract. Automated negotiation techniques have received considerable attention over the past decade, and much progress has been made in developing negotiation protocols and strate...
Paul E. Dunne, Michael Laurence, Michael Wooldridg...
CAV
2008
Springer
96views Hardware» more  CAV 2008»
15 years 8 months ago
Implied Set Closure and Its Application to Memory Consistency Verification
Hangal et. al. [3] have developed a procedure to check if an instance of the execution of a shared memory multiprocessor program, is consistent with the Total Store Order (TSO) mem...
Surender Baswana, Shashank K. Mehta, Vishal Powar
SODA
2012
ACM
227views Algorithms» more  SODA 2012»
13 years 9 months ago
Improved output-sensitive quantum algorithms for Boolean matrix multiplication
We present new quantum algorithms for Boolean Matrix Multiplication in both the time complexity and the query complexity settings. As far as time complexity is concerned, our resu...
François Le Gall
CVPR
2005
IEEE
16 years 8 months ago
Optimal Sub-Shape Models by Minimum Description Length
Active shape models are a powerful and widely used tool to interpret complex image data. By building models of shape variation they enable search algorithms to use a priori knowle...
Georg Langs, Philipp Peloschek, Horst Bischof