Sciweavers

1015 search results - page 93 / 203
» An efficient algorithm for AS path inferring
Sort
View
ICLP
2007
Springer
14 years 2 days ago
OnEQL: An Ontology Efficient Query Language Engine for the Semantic Web
Abstract. In this paper we describe the OnEQL system, a query engine that implements optimization techniques and evaluation strategies to speed up the evaluation time of querying a...
Edna Ruckhaus, Maria-Esther Vidal, Eduardo Ruiz
UAI
2001
13 years 9 months ago
Toward General Analysis of Recursive Probability Models
There is increasing interest within the research community in the design and use of recursive probability models. There remains concern about computational complexity costs and th...
Daniel Pless, George F. Luger
AAAI
2010
13 years 9 months ago
Searching Without a Heuristic: Efficient Use of Abstraction
g Without a Heuristic: Efficient Use of Abstraction Bradford Larsen, Ethan Burns, Wheeler Ruml Department of Computer Science University of New Hampshire Durham, NH 03824 USA blars...
Bradford John Larsen, Ethan Burns, Wheeler Ruml, R...
ICCAD
2000
IEEE
153views Hardware» more  ICCAD 2000»
13 years 11 months ago
Slope Propagation in Static Timing Analysis
ct Static timing analysis has traditionally used the PERT method for identifying the critical path of a digital circuit. Due to the influence of the slope of a signal at a particul...
David Blaauw, Vladimir Zolotov, Savithri Sundaresw...
CIKM
2004
Springer
13 years 12 months ago
Efficient processing of XML twig patterns with parent child edges: a look-ahead approach
With the growing importance of semi-structure data in information exchange, much research has been done to provide an effective mechanism to match a twig query in an XML database....
Jiaheng Lu, Ting Chen, Tok Wang Ling