Sciweavers

724 search results - page 117 / 145
» Practical Performance of Efficient Minimum Cut Algorithms
Sort
View
SIGSOFT
1994
ACM
15 years 7 months ago
Speeding up Slicing
Program slicing is a fundamental operation for many software engineering tools. Currently, the most efficient algorithm for interprocedural slicing is one that uses a program repr...
Thomas W. Reps, Susan Horwitz, Shmuel Sagiv, Genev...
WACV
2008
IEEE
15 years 9 months ago
Distributed Visual Processing for a Home Visual Sensor Network
deliver objects, handle emergency, wherever he/she is inside the home. In addition, the burden of processing We address issues dealing with distributed visual power can be distribu...
Kwangsu Kim, Gérard G. Medioni
TCAD
2010
88views more  TCAD 2010»
14 years 9 months ago
Stress Aware Layout Optimization Leveraging Active Area Dependent Mobility Enhancement
Starting from the 90nm technology node, process induced stress has played a key role in the design of highperformance devices. The emergence of source/drain silicon germanium (S/D ...
Ashutosh Chakraborty, Sean X. Shi, David Z. Pan
ANOR
2005
160views more  ANOR 2005»
15 years 3 months ago
Packing r-Cliques in Weighted Chordal Graphs
In Hell et al. (2004), we have previously observed that, in a chordal graph G, the maximum number of independent r-cliques (i.e., of vertex disjoint subgraphs of G, each isomorphic...
Pavol Hell, Sulamita Klein, Loana Tito Nogueira, F...
CGF
2005
111views more  CGF 2005»
15 years 3 months ago
Hierarchyless Simplification, Stripification and Compression of Triangulated Two Manifolds
In this paper we explore the algorithmic space in which stripification, simplification and geometric compression of triangulated 2-manifolds overlap. Edge-collase/uncollapse based...
Pablo Diaz-Gutierrez, Meenakshisundaram Gopi, Rena...