Sciweavers

2492 search results - page 440 / 499
» On the General Signature Trees
Sort
View
CG
1998
Springer
13 years 8 months ago
Smooth transitions in texture-based simplification
We are investigating techniques for providing smooth transitions when simplifying large, static geometric models with texture-based representations (or impostors). Traditionally, ...
Daniel G. Aliaga, Anselmo Lastra
IJFCS
1998
67views more  IJFCS 1998»
13 years 8 months ago
Vertex Splitting in Dags and Applications to Partial Scan Designs and Lossy Circuits
Directed acyclic graphs (dags) are often used to model circuits. Path lengths in such dags represent circuit delays. In the vertex splitting problem, the objective is to determine...
Doowon Paik, Sudhakar M. Reddy, Sartaj Sahni
CORR
1999
Springer
118views Education» more  CORR 1999»
13 years 8 months ago
Supervised Grammar Induction Using Training Data with Limited Constituent Information
Corpus-based grammar induction generally relies on hand-parsed training data to learn the structure of the language. Unfortunately, the cost of building large annotated corpora is...
Rebecca Hwa
DATAMINE
1999
108views more  DATAMINE 1999»
13 years 8 months ago
A Survey of Methods for Scaling Up Inductive Algorithms
Abstract. One of the de ning challenges for the KDD research community is to enable inductive learning algorithms to mine very large databases. This paper summarizes, categorizes, ...
Foster J. Provost, Venkateswarlu Kolluri
TEC
2002
119views more  TEC 2002»
13 years 8 months ago
Graph-based evolutionary design of arithmetic circuits
Abstract--In this paper, we present an efficient graph-based evolutionary optimization technique called evolutionary graph generation (EGG) and the proposed approach is applied to ...
Dingjun Chen, Takafumi Aoki, Naofumi Homma, Toshik...