Sciweavers

44 search results - page 5 / 9
» Decomposing Global Grammar Constraints
Sort
View
ICDE
2007
IEEE
148views Database» more  ICDE 2007»
14 years 8 months ago
Efficient Detection of Distributed Constraint Violations
In many distributed environments, the primary function of monitoring software is to detect anomalies, that is, instances when system behavior deviates substantially from the norm....
Shipra Agrawal, Supratim Deb, K. V. M. Naidu, Raje...
CVPR
2008
IEEE
14 years 9 months ago
Intrinsic image decomposition with non-local texture cues
We present a method for decomposing an image into its intrinsic reflectance and shading components. Different from previous work, our method examines texture information to obtain...
Li Shen, Ping Tan, Stephen Lin
CORR
2008
Springer
153views Education» more  CORR 2008»
13 years 7 months ago
Decomposition Techniques for Subgraph Matching
In the constraint programming framework, state-of-the-art static and dynamic decomposition techniques are hard to apply to problems with complete initial constraint graphs. For suc...
Stéphane Zampelli, Martin Mann, Yves Devill...
LISA
2003
13 years 8 months ago
Using Service Grammar to Diagnose BGP Configuration Errors
Often network components work correctly, yet end-to-end services don’t. This happens if configuration parameters of components are set to incorrect values. Configuration is a fu...
Xiaohu Qie, Sanjai Narain
ICCAD
2000
IEEE
102views Hardware» more  ICCAD 2000»
13 years 11 months ago
Provably Good Global Buffering Using an Available Buffer Block Plan
To implement high-performance global interconnect without impacting the performance of existing blocks, the use of buffer blocks is increasingly popular in structured-custom and b...
Feodor F. Dragan, Andrew B. Kahng, Ion I. Mandoiu,...