Sciweavers

942 search results - page 163 / 189
» Constraints in Graph Drawing Algorithms
Sort
View
ISPASS
2006
IEEE
14 years 3 months ago
Critical path analysis of the TRIPS architecture
Fast, accurate, and effective performance analysis is essential for the design of modern processor architectures and improving application performance. Recent trends toward highly...
Ramadass Nagarajan, Xia Chen, Robert G. McDonald, ...
SPAA
2003
ACM
14 years 3 months ago
Short length menger's theorem and reliable optical routing
In the minimum path coloring problem, we are given a graph and a set of pairs of vertices of the graph and we are asked to connect the pairs by colored paths in such a way that pa...
Amitabha Bagchi, Amitabh Chaudhary, Petr Kolman
SMA
2009
ACM
149views Solid Modeling» more  SMA 2009»
14 years 4 months ago
A sketching interface for feature curve recovery of free-form surfaces
In this paper, we present a semi-automatic approach to efficiently and robustly recover the characteristic feature curves of a given free-form surface. The technique supports a s...
Ellen Dekkers, Leif Kobbelt, Richard R. Pawlicki, ...
CGF
2008
131views more  CGF 2008»
13 years 10 months ago
Peek-in-the-Pic: Flying Through Architectural Scenes From a Single Image
Many casually taken "tourist" photographs comprise of architectural objects like houses, buildings, etc. Reconstructing such 3D scenes captured in a single photograph is...
Amit Shesh, Baoquan Chen
KDD
2007
ACM
249views Data Mining» more  KDD 2007»
14 years 10 months ago
The minimum consistent subset cover problem and its applications in data mining
In this paper, we introduce and study the Minimum Consistent Subset Cover (MCSC) problem. Given a finite ground set X and a constraint t, find the minimum number of consistent sub...
Byron J. Gao, Martin Ester, Jin-yi Cai, Oliver Sch...