16504 search results - page 357 / 3301 » New Problems, New Solutions |
195
click to vote
DATAMINE
1998
15 years 6 months ago
1998
Data mining evolved as a collection of applicative problems and efficient solution algorithms relative to rather peculiar problems, all focused on the discovery of relevant infor...
169
Voted
MFCS
2007
Springer
16 years 27 days ago
2007
Springer
Abstract. We introduce a new general polynomial-time constructionthe fibre construction- which reduces any constraint satisfaction problem CSP(H) to the constraint satisfaction pr...
152
click to vote
AE
2007
Springer
16 years 29 days ago
2007
Springer
The evaluation or fitness function is a key component of any heuristic search algorithm. This paper introduces a new evaluation function for the well-known graph K-coloring proble...
153
click to vote
FOCS
2006
IEEE
16 years 25 days ago
2006
IEEE
We present new algebraic approaches for several wellknown combinatorial problems, including non-bipartite matching, matroid intersection, and some of their generalizations. Our wo...
204
click to vote
ROBVIS
2001
Springer
15 years 11 months ago
2001
Springer
This paper reviews papers on tracking people in a video surveillance system, and it presents a new system designed for being able to cope with shadows in a real-time application f...