792 search results - page 146 / 159 » Measuring complexity by measuring structure and organization |
IGIS
1994
15 years 1 months ago
1994
There have been many interpolation methods developed over the years, each with their own problems. One of the biggest limitations in many applications is the non-correspondence of...
63
Voted
ICDE
2010
IEEE
15 years 9 months ago
2010
IEEE
Abstract-- We consider the Top-k Approximate Subtree Matching (TASM) problem: finding the k best matches of a small query tree, e.g., a DBLP article with 15 nodes, in a large docum...
HT
2009
ACM
15 years 4 months ago
2009
ACM
Web pages such as news and shopping sites often use modular layouts. When used effectively this practice allows authors to present clearly large amounts of information in a single...
INFOCOM
2006
IEEE
15 years 3 months ago
2006
IEEE
— Internet paths sharing the same bottleneck can be identified using several shared congestion detection techniques. However, all of these techniques have been designed to detec...
137
click to vote
STOC
1993
ACM
15 years 1 months ago
1993
ACM
Most complexity measures for concurrent algorithms for asynchronous shared-memory architectures focus on process steps and memory consumption. In practice, however, performance of ...