Sciweavers

1095 search results - page 205 / 219
» Preprocessing of Intractable Problems
Sort
View
STACS
2007
Springer
14 years 1 months ago
Testing Convexity Properties of Tree Colorings
A coloring of a graph is convex if it induces a partition of the vertices into connected subgraphs. Besides being an interesting property from a theoretical point of view, tests f...
Eldar Fischer, Orly Yahalom
SIBGRAPI
2006
IEEE
14 years 1 months ago
Determining the branchings of 3D structures from respective 2D projections
This work describes a new framework for automatic extraction of 2D branching structures images obtained from 3D shapes, such as neurons and retinopathy images. The majority of met...
Jorge J. G. Leandro, Roberto M. Cesar, Luciano da ...
VISUALIZATION
2005
IEEE
14 years 1 months ago
View-Dependent Rendering of Multiresolution Texture-Atlases
Real-time rendering of massively textured 3D scenes usually involves two major problems: Large numbers of texture switches are a well-known performance bottleneck and the set of s...
Henrik Buchholz, Jürgen Döllner
IQIS
2005
ACM
14 years 1 months ago
Exploiting relationships for object consolidation
Researchers in the data mining area frequently have to spend significant portion of their time on preprocessing the data in order to apply their algorithms to real-world datasets...
Zhaoqi Chen, Dmitri V. Kalashnikov, Sharad Mehrotr...
SIGIR
2005
ACM
14 years 1 months ago
Orthogonal locality preserving indexing
We consider the problem of document indexing and representation. Recently, Locality Preserving Indexing (LPI) was proposed for learning a compact document subspace. Different from...
Deng Cai, Xiaofei He