Sciweavers

2877 search results - page 528 / 576
» The Complexity of Planarity Testing
Sort
View
KR
2004
Springer
14 years 3 months ago
On Eliminating Disjunctions in Stable Logic Programming
Disjunction is generally considered to add expressive power to logic programs under the stable model semantics, which have become a popular programming paradigm for knowledge repr...
Thomas Eiter, Michael Fink, Hans Tompits, Stefan W...
DATE
2003
IEEE
140views Hardware» more  DATE 2003»
14 years 3 months ago
Qualifying Precision of Abstract SystemC Models Using the SystemC Verification Standard
ng precision of abstract SystemC models using the SystemC Verification Standard Franco Carbognani1 , Christopher K. Lennard2 , C. Norris Ip3 , Allan Cochrane2 , Paul Bates2 1 Caden...
Franco Carbognani, Christopher K. Lennard, C. Norr...
PVG
2003
IEEE
212views Visualization» more  PVG 2003»
14 years 3 months ago
SLIC: Scheduled Linear Image Compositing for Parallel Volume Rendering
Parallel volume rendering offers a feasible solution to the large data visualization problem by distributing both the data and rendering calculations among multiple computers con...
Aleksander Stompel, Kwan-Liu Ma, Eric B. Lum, Jame...
SSDBM
2003
IEEE
105views Database» more  SSDBM 2003»
14 years 3 months ago
Using Bitmap Index for Interactive Exploration of Large Datasets
Many scientific applications generate large spatiotemporal datasets. A common way of exploring these datasets is to identify and track regions of interest. Usually these regions ...
Kesheng Wu, Wendy S. Koegler, Jacqueline Chen, Ari...
PLDI
2003
ACM
14 years 3 months ago
Meta optimization: improving compiler heuristics with machine learning
Compiler writers have crafted many heuristics over the years to approximately solve NP-hard problems efficiently. Finding a heuristic that performs well on a broad range of applic...
Mark Stephenson, Saman P. Amarasinghe, Martin C. M...