Sciweavers

903 search results - page 50 / 181
» Non-well-founded trees in categories
Sort
View
EDBT
2010
ACM
180views Database» more  EDBT 2010»
15 years 8 months ago
BSkyTree: scalable skyline computation using a balanced pivot selection
Skyline queries have gained a lot of attention for multicriteria analysis in large-scale datasets. While existing skyline algorithms have focused mostly on exploiting data dominan...
Jongwuk Lee, Seung-won Hwang
GLVLSI
2003
IEEE
135views VLSI» more  GLVLSI 2003»
15 years 7 months ago
Constructing exact octagonal steiner minimal trees
Octagonal Steiner Minimal Trees (OSMTs) are used in the global routing phase of pervasive octagonal VLSI layout. The OSMT problem seeks a minimal length spanning structure using e...
Chris Coulston
WWW
2004
ACM
16 years 2 months ago
Parsing owl dl: trees or triples?
The Web Ontology Language (OWL) defines three classes of documents: Lite, DL and Full. All RDF/XML documents are OWL Full documents, some OWL Full documents are also OWL DL docume...
Sean Bechhofer, Jeremy J. Carroll
KDD
2005
ACM
104views Data Mining» more  KDD 2005»
16 years 2 months ago
Mining tree queries in a graph
We present an algorithm for mining tree-shaped patterns in a large graph. Novel about our class of patterns is that they can contain constants, and can contain existential nodes w...
Bart Goethals, Eveline Hoekx, Jan Van den Bussche
ISPD
2010
ACM
177views Hardware» more  ISPD 2010»
15 years 8 months ago
Skew management of NBTI impacted gated clock trees
NBTI (Negative Bias Temperature Instability) has emerged as the dominant failure mechanism for PMOS in nanometer IC designs. However, its impact on one of the most important compo...
Ashutosh Chakraborty, David Z. Pan