Sciweavers

3820 search results - page 107 / 764
» Bounded Model Debugging
Sort
View
CGF
2007
135views more  CGF 2007»
15 years 4 months ago
Variational 3D Shape Segmentation for Bounding Volume Computation
We propose a variational approach to computing an optimal segmentation of a 3D shape for computing a union of tight bounding volumes. Based on an affine invariant measure of e-ti...
Lin Lu, Yi-King Choi, Wenping Wang, Myung-Soo Kim
EUROSYS
2006
ACM
16 years 1 months ago
Using queries for distributed monitoring and forensics
Distributed systems are hard to build, profile, debug, and test. Monitoring a distributed system – to detect and analyze bugs, test for regressions, identify fault-tolerance pr...
Atul Singh, Petros Maniatis, Timothy Roscoe, Peter...
NCA
2005
IEEE
15 years 10 months ago
Fundamental Network Processor Performance Bounds
In this paper, fundamental conditions which bound the network processing unit (NPU) worst-case performance are established. In particular, these conditions formalize and integrate...
Hao Che, Chethan Kumar, Basavaraj Menasinahal
IWDW
2005
Springer
15 years 10 months ago
Performance Lower Bounds for Existing and New Uncoded Digital Watermarking Modulation Techniques
Abstract. Many coded digital watermarking systems development requires first the selection of a (uncoded) modulation technique to be part of a coded architecture. Therefore, perfo...
Marcos de Castro Pacitti, Weiler Alves Finamore
164
Voted
COCO
2001
Springer
161views Algorithms» more  COCO 2001»
15 years 9 months ago
Communication Complexity Lower Bounds by Polynomials
The quantum version of communication complexity allows the two communicating parties to exchange qubits and/or to make use of prior entanglement (shared EPRpairs). Some lower boun...
Harry Buhrman, Ronald de Wolf