Sciweavers

134 search results - page 1 / 27
» An Optimal Rebuilding Strategy for an Incremental Tree Probl...
Sort
View
JOIN
2007
91views more  JOIN 2007»
13 years 3 months ago
An Optimal Rebuilding Strategy for an Incremental Tree Problem
This paper is devoted to the following incremental problem. Initially, a graph and a distinguished subset of vertices, called initial group, are given. This group is connected by ...
Nicolas Thibault, Christian Laforest
SIGGRAPH
1996
ACM
13 years 7 months ago
Hierarchical View-Dependent Structures for Interactive Scene Manipulation
The result of a scene manipulation is usually displayed by rerendering the entire image even if the change has affected only a small portion of it. This paper presents a system th...
Normand Brière, Pierre Poulin
ICCAD
1997
IEEE
108views Hardware» more  ICCAD 1997»
13 years 7 months ago
Negative thinking by incremental problem solving: application to unate covering
We introduce a new technique to solve exactly a discrete optimization problem, based on the paradigm of “negative” thinking. The motivation is that when searching the space of...
Evguenii I. Goldberg, Luca P. Carloni, Tiziano Vil...
SIGMOD
1999
ACM
122views Database» more  SIGMOD 1999»
13 years 8 months ago
BOAT-Optimistic Decision Tree Construction
Classification is an important data mining problem. Given a training database of records, each tagged with a class label, the goal of classification is to build a concise model ...
Johannes Gehrke, Venkatesh Ganti, Raghu Ramakrishn...
COCOON
1997
Springer
13 years 7 months ago
Edge and Node Searching Problems on Trees
In this paper, we consider the edge searching and node searching problems on trees. Given a tree, we show a transformation from an optimal node-search strategy to an optimal edge-...
Sheng-Lung Peng, Chin-Wen Ho, Tsan-sheng Hsu, Ming...