Sciweavers

2087 search results - page 118 / 418
» Computation of class numbers of quadratic number fields
Sort
View

Book
357views
16 years 8 months ago
Foundations of Constraint Satisfaction
"Constraint satisfaction is a general problem in which the goal is to find values for a set of variables that will satisfy a given set of constraints. It is the core of many a...
Edward Tsang
DCC
2006
IEEE
15 years 9 months ago
Distributed Sampling and Compression of Scenes with Finite Rate of Innovation in Camera Sensor Networks
We study the problem of distributed sampling and compression in sensor networks when the sensors are digital cameras that acquire a 3-D visual scene of interest from different vie...
Nicolas Gehrig, Pier Luigi Dragotti
APPROX
2009
Springer
137views Algorithms» more  APPROX 2009»
15 years 4 months ago
Testing Computability by Width Two OBDDs
Property testing is concerned with deciding whether an object (e.g. a graph or a function) has a certain property or is “far” (for some definition of far) from every object w...
Dana Ron, Gilad Tsur
BVAI
2007
Springer
15 years 4 months ago
Classification with Positive and Negative Equivalence Constraints: Theory, Computation and Human Experiments
We tested the efficiency of category learning when participants are provided only with pairs of objects, known to belong either to the same class (Positive Equivalence Constraints ...
Rubi Hammer, Tomer Hertz, Shaul Hochstein, Daphna ...
FCT
1999
Springer
15 years 2 months ago
Restrictive Acceptance Suffices for Equivalence Problems
One way of suggesting that an NP problem may not be NP-complete is to show that it is in the promise class UP. We propose an analogous new method—weaker in strength of evidence ...
Bernd Borchert, Lane A. Hemaspaandra, Jörg Ro...