5606 search results - page 114 / 1122 » Randomization Techniques for Graphs. |
ICDAR
2009
IEEE
14 years 5 months ago
2009
IEEE
There are a number of established products on the market for wrapping—semi-automatic navigation and extraction of data—from web pages. These solutions make use of the inherent...
ICPR
2002
IEEE
14 years 11 months ago
2002
IEEE
CODES
2005
IEEE
14 years 4 months ago
2005
IEEE
This paper proposes a new efficient buffer management technique called shift buffering for automatic code synthesis from synchronous dataflow graphs (SDF). Two previous buffer man...
ICPP
1997
IEEE
14 years 2 months ago
1997
IEEE
Optamzztng compalataon as very amportant for generatang code sequentes an order to utalaze the characterastacs of processor archatectures. One of the most essentaal optzmazataon t...
JAIR
2000
13 years 10 months ago
2000
This paper reviews the connections between Graphplan's planning-graph and the dynamic constraint satisfaction problem and motivates the need for adapting CSP search technique...