Sciweavers

1736 search results - page 312 / 348
» On antimagic directed graphs
Sort
View
PLDI
1998
ACM
14 years 2 months ago
Quality and Speed in Linear-scan Register Allocation
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...
Omri Traub, Glenn H. Holloway, Michael D. Smith
SIGMOD
1998
ACM
150views Database» more  SIGMOD 1998»
14 years 2 months ago
Extracting Schema from Semistructured Data
Semistructured data is characterized by the lack of any fixed and rigid schema, although typically the data hassomeimplicitstructure. While thelack offixedschemamakesextracting ...
Svetlozar Nestorov, Serge Abiteboul, Rajeev Motwan...
DATE
1997
IEEE
89views Hardware» more  DATE 1997»
14 years 2 months ago
Cone-based clustering heuristic for list-scheduling algorithms
List scheduling algorithms attempt to minimize latency under resource constraints using a priority list. We propose a new heuristic that can be used in conjunction with any priori...
Sriram Govindarajan, Ranga Vemuri
IEEEPACT
1997
IEEE
14 years 2 months ago
A Parallel Algorithm for Compile-Time Scheduling of Parallel Programs on Multiprocessors
† In this paper, we propose a parallel randomized algorithm, called Parallel Fast Assignment using Search Technique (PFAST), for scheduling parallel programs represented by direc...
Yu-Kwong Kwok, Ishfaq Ahmad
CHI
1996
ACM
14 years 2 months ago
Silk from a Sow's Ear: Extracting Usable Structures from the Web
In its current implementation, the World-Wide Web lacks much of the explicit structure and strong typing found in many closed hypertext systems. While this property has directly f...
Peter Pirolli, James E. Pitkow, Ramana Rao