16093 search results - page 2976 / 3219 » On the optimality of the neighbor-joining algorithm |
164
click to vote
RTAS
1998
IEEE
15 years 11 months ago
1998
IEEE
Static timing analyzers need to know the minimum and maximum number of iterations associated with each loop in a real-time program so accurate timing predictions can be obtained. ...
244
click to vote
PLDI
1998
ACM
15 years 11 months ago
1998
ACM
A linear-scan algorithm directs the global allocation of register candidates to registers based on a simple linear sweep over the program being compiled. This approach to register...
164
click to vote
CPM
1998
Springer
15 years 11 months ago
1998
Springer
d abstract) John Kececioglu and Dean Starrett Department of Computer Science The University of Arizona Tucson AZ 85721, USA A basic computational problem that arises in both the...
179
click to vote
SIGMOD
1998
ACM
15 years 11 months ago
1998
ACM
Semistructured data is characterized by the lack of any fixed and rigid schema, although typically the data hassomeimplicitstructure. While thelack offixedschemamakesextracting ...
151
click to vote
ICCAD
1997
IEEE
15 years 11 months ago
1997
IEEE
Memory-intensive behaviors often contain large arrays that are synthesized into off-chip memories. With the increasing gap between on-chip and off-chip memory access delays, it is...