Sciweavers

1977 search results - page 370 / 396
» The satisfactory partition problem
Sort
View
KAIS
2006
247views more  KAIS 2006»
13 years 9 months ago
XCQ: A queriable XML compression system
XML has already become the de facto standard for specifying and exchanging data on the Web. However, XML is by nature verbose and thus XML documents are usually large in size, a fa...
Wilfred Ng, Wai Yeung Lam, Peter T. Wood, Mark Lev...
CGF
1998
110views more  CGF 1998»
13 years 9 months ago
Adaptive Supersampling in Object Space Using Pyramidal Rays
We introduce a new approach to three important problems in ray tracing: antialiasing, distributed light sources, and fuzzy reflections of lights and other surfaces. For antialias...
Jon D. Genetti, Dan Gordon, G. Williams
TCAD
1998
86views more  TCAD 1998»
13 years 9 months ago
Fast heuristic and exact algorithms for two-level hazard-free logic minimization
None of the available minimizers for 2-level hazard-free logic minimization can synthesize very large circuits. This limitation has forced researchers to resort to manual and auto...
Michael Theobald, Steven M. Nowick
GIS
2010
ACM
13 years 7 months ago
Natural neighbor interpolation based grid DEM construction using a GPU
With modern LiDAR technology the amount of topographic data, in the form of massive point clouds, has increased dramatically. One of the most fundamental GIS tasks is to construct...
Alex Beutel, Thomas Mølhave, Pankaj K. Agar...
PKDD
2010
Springer
235views Data Mining» more  PKDD 2010»
13 years 7 months ago
Online Structural Graph Clustering Using Frequent Subgraph Mining
The goal of graph clustering is to partition objects in a graph database into different clusters based on various criteria such as vertex connectivity, neighborhood similarity or t...
Madeleine Seeland, Tobias Girschick, Fabian Buchwa...