Sciweavers

2600 search results - page 195 / 520
» Clustering with or without the Approximation
Sort
View
COCO
2005
Springer
89views Algorithms» more  COCO 2005»
16 years 2 days ago
Hardness of Max 3SAT with No Mixed Clauses
We study the complexity of approximating Max NME3SAT, a variant of Max 3SAT when the instances are guaranteed to not have any mixed clauses, i.e., every clause has either all its ...
Venkatesan Guruswami, Subhash Khot
JSC
2006
147views more  JSC 2006»
15 years 6 months ago
An algorithm to solve integer linear systems exactly using numerical methods
In this paper, we present a new algorithm for the exact solutions of linear systems with integer coefficients using numerical methods. It terminates with the correct answer in wel...
Zhendong Wan
ICARIS
2005
Springer
16 years 2 days ago
Two Ways to Grow Tissue for Artificial Immune Systems
An immune system without tissue is like evolution without genes. Something very important is missing. Here we present the novel concept of tissue for artificial immune systems. Muc...
Peter J. Bentley, Julie Greensmith, Supiya Ujjin
ICASSP
2009
IEEE
16 years 1 months ago
Comparison of scoring methods used in speaker recognition with Joint Factor Analysis
The aim of this paper is to compare different log-likelihood scoring methods, that different sites used in the latest state-of-the-art Joint Factor Analysis (JFA) Speaker Recognit...
Ondrej Glembek, Lukas Burget, Najim Dehak, Niko Br...
CP
2005
Springer
16 years 2 days ago
Using Constraint Programming for Solving Distance CSP with Uncertainty
Many problems in chemistry, robotics or molecular biology can be expressed as a Distance CSP4 . In this paper, we propose a specific methodology for tackling uncertainties in this...
Carlos Grandón, Bertrand Neveu