2859 search results - page 421 / 572 » Querying Complex Structured Databases |
168
click to vote
IPL
2010
15 years 4 months ago
2010
We derive a new generalization of lowest common ancestors (LCAs) in dags, called the lowest single common ancestor (LSCA). We show how to preprocess a static dag in linear time su...
185
click to vote
ICCSA
2007
Springer
16 years 18 days ago
2007
Springer
Abstract. Determining whether two segments s and t in a planar polygonal scene weakly see each other is a classical problem in computational geometry. In this problem we seek for a...
182
Voted
DASFAA
2007
IEEE
16 years 24 days ago
2007
IEEE
Twig pattern matching problem has been widely studied in recent years. Give an XML tree T . A twig-pattern matching query, Q, represented as a query tree, is to find all the occur...
164
click to vote
TCAD
1998
15 years 6 months ago
1998
— Integrated circuits have evolved to a stage where interconnections significantly limit their performance and functional complexity. We introduce a set of tools to perform high...
184
click to vote
SIGSAND
2008
15 years 7 months ago
2008
Abstract: A closer look at typical information systems shows that relatively simple routines often contribute significantly to the overall expenses of the software development proc...