Sciweavers

1952 search results - page 294 / 391
» Complete partitions of graphs
Sort
View
AAAI
1997
15 years 7 months ago
Model Decomposition and Simulation: A Component Based Qualitative Simulation Algorithm
Traditionally, qualitative simulation uses a global, state-based representation to describe the behavior of the modeled system. For larger, more complex systems this representatio...
Daniel J. Clancy, Benjamin Kuipers
IPCO
1992
112views Optimization» more  IPCO 1992»
15 years 7 months ago
The Metric Polytope
In this paper we study enumeration problems for polytopes arising from combinatorial optimization problems. While these polytopes turn out to be quickly intractable for enumeration...
Monique Laurent, Svatopluk Poljak
ICDE
2010
IEEE
180views Database» more  ICDE 2010»
15 years 6 months ago
Adaptive indexing for relational keys
: © Adaptive indexing for relational keys Goetz Graefe, Harumi Kuno HP Laboratories HPL-2010-23 databases, indexes, storage systems, B-trees, adaptive merging, database cracking A...
Goetz Graefe, Harumi A. Kuno
CORR
2007
Springer
110views Education» more  CORR 2007»
15 years 6 months ago
Relations between random coding exponents and the statistical physics of random codes
The partition function pertaining to finite–temperature decoding of a (typical) randomly chosen code is known to have three types of behavior, corresponding to three phases in ...
Neri Merhav
JMM2
2008
130views more  JMM2 2008»
15 years 6 months ago
A Robust Image Watermarking Scheme using Singular Value Decomposition
This paper presents a robust image watermarking scheme for multimedia copyright protection. In this work, host image is partitioned into four sub images. Watermark image such as `l...
B. Chandra Mohan, S. Srinivas Kumar