Sciweavers

1074 search results - page 48 / 215
» Adaptive color reduction
Sort
View
WEA
2007
Springer
116views Algorithms» more  WEA 2007»
16 years 11 days ago
Optimal Edge Deletions for Signed Graph Balancing
The Balanced Subgraph problem (edge deletion variant) asks for a 2-coloring of a graph that minimizes the inconsistencies with given edge labels. It has applications in social netw...
Falk Hüffner, Nadja Betzler, Rolf Niedermeier
COMPGEOM
2006
ACM
16 years 7 days ago
Colored intersection searching via sparse rectangular matrix multiplication
In a Batched Colored Intersection Searching Problem (CI), one is given a set of n geometric objects (of a certain class). Each object is colored by one of c colors, and the goal i...
Haim Kaplan, Micha Sharir, Elad Verbin
ICCCN
2007
IEEE
16 years 18 days ago
A Novel Signal Reconstruction Algorithm for Perception Based Data Reduction in Haptic Signal Communication
The performance and immersiveness of telepresence and teleaction systems critically depend on the quality of the communication between the operator and the teleoperator. High pack...
Julius Kammerl, Peter Hinterseer, Eckehard G. Stei...
LICS
1994
IEEE
15 years 10 months ago
A Fully Abstract Semantics for Concurrent Graph Reduction
abstract semantics for concurrent graph reduction ALAN JEFFREY This paper presents a fully abstract semantics for a variant of the untyped -calculus with recursive declarations. We...
Alan Jeffrey
ISQED
2007
IEEE
151views Hardware» more  ISQED 2007»
16 years 16 days ago
Wavelet-Based Passivity Preserving Model Order Reduction for Wideband Interconnect Characterization
Model order reduction plays a key role in determining VLSI system performance and the optimization of interconnects. In this paper, we develop an accurate and provably passive met...
Mehboob Alam, Arthur Nieuwoudt, Yehia Massoud