2859 search results - page 421 / 572 » Querying Complex Structured Databases |
111
Voted
IPL
2010
15 years 19 days 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...
125
Voted
ICCSA
2007
Springer
15 years 8 months 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...
127
Voted
DASFAA
2007
IEEE
15 years 8 months 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...
113
Voted
TCAD
1998
15 years 1 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...
131
Voted
SIGSAND
2008
15 years 3 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...