Sciweavers

4103 search results - page 544 / 821
» Some results on the Collatz problem
Sort
View
FUIN
2006
67views more  FUIN 2006»
15 years 6 months ago
On minimal models of the Region Connection Calculus
Abstract. Region Connection Calculus (RCC) is one primary formalism of qualitative spatial reasoning. Standard RCC models are continuous ones where each region is infinitely divisi...
Lirong Xia, Sanjiang Li
IJON
2007
100views more  IJON 2007»
15 years 6 months ago
Minimum range approach to blind partial simultaneous separation of bounded sources: Contrast and discriminacy properties
The blind source separation (BSS) problem is often solved by maximizing objective functions reflecting the statistical independence between outputs. Since global maximization may...
Frédéric Vrins, Dinh-Tuan Pham
TDP
2008
160views more  TDP 2008»
15 years 6 months ago
Enhanced P-Sensitive K-Anonymity Models for Privacy Preserving Data Publishing
Publishing data for analysis from a micro data table containing sensitive attributes, while maintaining individual privacy, is a problem of increasing significance today. The k-ano...
Xiaoxun Sun, Hua Wang, Jiuyong Li, Traian Marius T...
LCC
1994
248views Algorithms» more  LCC 1994»
15 years 10 months ago
Comparing the Power of Monadic NP Games
The descriptive complexity of a problem is the complexity of describing the problem in some logical formalism. One of the few techniques for proving separation results in descripti...
Ronald Fagin
STACS
2010
Springer
16 years 1 months ago
Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs
In 2000 Alber et al. [SWAT 2000 ] obtained the first parameterized subexponential algorithm on undirected planar graphs by showing that k-DOMINATING SET is solvable in time 2O( ...
Frederic Dorn, Fedor V. Fomin, Daniel Lokshtanov, ...