1529 search results - page 271 / 306 » A slant removal algorithm |
VIS
2004
IEEE
14 years 10 months ago
2004
IEEE
This paper introduces importance-driven volume rendering as a novel technique for automatic focus and context display of volumetric data. Our technique is a generalization of cut-...
SIGSOFT
2007
ACM
14 years 9 months ago
2007
ACM
Studies show that programs contain much similar code, commonly known as clones. One of the main reasons for introducing clones is programmers' tendency to copy and paste code...
STOC
2009
ACM
14 years 9 months ago
2009
ACM
We study the topological simplification of graphs via random embeddings, leading ultimately to a reduction of the Gupta-Newman-Rabinovich-Sinclair (GNRS) L1 embedding conjecture t...
KDD
2006
ACM
14 years 9 months ago
2006
ACM
Observed in many applications, there is a potential need of extracting a small set of frequent patterns having not only high significance but also low redundancy. The significance...
STOC
2005
ACM
14 years 9 months ago
2005
ACM
A graph property is called monotone if it is closed under taking (not necessarily induced) subgraphs (or, equivalently, if it is closed under removal of edges and vertices). Many ...