Sciweavers

1450 search results - page 72 / 290
» On the Complexity of Hardness Amplification
Sort
View
SIAMCOMP
2010
135views more  SIAMCOMP 2010»
13 years 3 months ago
Intractability of Clique-Width Parameterizations
We show that Edge Dominating Set, Hamiltonian Cycle, and Graph Coloring are W[1]-hard parameterized by clique-width. It was an open problem, explicitly mentioned in several papers,...
Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtano...
PODS
2012
ACM
297views Database» more  PODS 2012»
11 years 11 months ago
Query-based data pricing
Data is increasingly being bought and sold online, and Webbased marketplace services have emerged to facilitate these activities. However, current mechanisms for pricing data are ...
Paraschos Koutris, Prasang Upadhyaya, Magdalena Ba...

Book
349views
15 years 4 months ago
Thinking in Java
"Much of the motivation and effort for this edition is to bring the book up to date with the Java JDK 1.4 release of the language. However, it has also become clear that most ...
Jolt Award
ICANN
2009
Springer
14 years 3 months ago
Almost Random Projection Machine
Backpropagation of errors is not only hard to justify from biological perspective but also it fails to solve problems requiring complex logic. A simpler algorithm based on generati...
Wlodzislaw Duch, Tomasz Maszczyk
ICPR
2008
IEEE
14 years 3 months ago
The Fourier Analysis of 2DT movement with particular reference to hand gesture recognition
This paper describes the mathematical underpinning used to analyse two dimensional movements with time using Fourier Analysis techniques. Interpreting the complex harmonic compone...
Peter R. G. Harding, Tim J. Ellis