1920 search results - page 70 / 384 » The Complexity of the A B C Problem |
162
click to vote
KDD
2006
ACM
16 years 6 months ago
2006
ACM
We describe a data mining system to detect frauds that are camouflaged to look like normal activities in domains with high number of known relationships. Examples include accounti...
150
click to vote
FCT
2005
Springer
15 years 11 months ago
2005
Springer
Sequence comparison is a fundamental task in pattern matching. Its applications include file comparison, spelling correction, information retrieval, and computing (dis)similaritie...
140
click to vote
ENTCS
2007
15 years 6 months ago
2007
The event B method provides a general framework for modelling both data structures and algorithms. B models are validated by discharging proof obligations ensuring safety properti...
148
click to vote
MVA
2002
15 years 5 months ago
2002
As digital cameras have been used widely, a technology to extract features of character string areas from scenery (nature) image is required. However, it is very difficult to extr...
181
Voted
COCOON
2006
Springer
15 years 9 months ago
2006
Springer
We study the dynamic bin packing problem introduced by Coffman, Garey and Johnson. This problem is a generalization of the bin packing problem in which items may arrive and depart...