599 search results - page 57 / 120 » The repeater tree construction problem |
133
click to vote
ICEIS
2009
IEEE
15 years 11 months ago
2009
IEEE
We propose two methods for constructing automated programs for extraction of information from a class of web pages that are very common and of high practical significance - varia...
108
click to vote
DAC
1993
ACM
15 years 8 months ago
1993
ACM
We present an efficient and effective method for the detailed routing of symmetrical or sea-of-gates FPGA architectures. Instead of breaking the problem into 2-terminal net collec...
127
click to vote
CORR
2004
Springer
15 years 4 months ago
2004
Springer
Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the safe omission of the occ...
104
click to vote
ISSAC
2007
Springer
15 years 10 months ago
2007
Springer
Supercomputing applications usually involve the repeated parallel application of discretized differential operators. Difficulties arise with higher-order discretizations of opera...
139
click to vote
DAGSTUHL
2006
15 years 5 months ago
2006
Supercomputing applications usually involve the repeated parallel application of discretized differential operators. Difficulties arise with higher-order discretizations their com...